Leon Henkin

From Wikipedia, the free encyclopedia

Leon Henkin (19 April 19211 November 2006) was a logician at the University of California, Berkeley. He was principally known for the "Henkin Completeness Proof": his version of the proof of the semantic completeness of standard systems of first-order logic.

Contents

Henkin's result was not novel; it had first been proved by Kurt Gödel in his doctoral dissertation which was completed in 1929. (See Gödel's completeness theorem. Gödel published a version of the proof in 1930.) Henkin's 1949 proof is much easier to survey than Gödel's and has thus become the standard choice of completeness proof for presentation in introductory classes and texts.

The proof is non-constructive (a pure existence proof): while it guarantees that if a sentence α follows (semantically) from a set of sentences Σ, then there is a proof of α from Σ, it gives no indication of the nature of that proof.

Later, Henkin generalized this result to a variant of Church's higher-order logic. This variant uses general models (also called Henkin models): the higher types need not be interpreted by the full space of functions; a subset of the function space may be used instead.

He was born in Brooklyn, into a Russian Jewish immigrant family. His first degree was in mathematics and philosophy from Columbia College, in 1941. He took a master's degree there in 1942.

He then worked in the Signal Corps Radar Laboratory, Belmar, New Jersey. As participant in the Manhattan project, he worked on isotope diffusion, in New York, and Oak Ridge, Tennessee.

He was a doctoral student of Alonzo Church at Princeton University, receiving his Ph.D. in 1947. He became Professor of Mathematics at the University of California, Berkeley, where he had a position from 1953. He received the 1964 Chauvenet Prize for exposition.[3] He was a collaborator of Alfred Tarski, and an ally in promoting logic.[1]

  • 2000 - Leon Henkin Citation - for Distinguished Service, which is presented to a (UC) faculty member for "exceptional commitment to the educational development of students from groups who are underrepresented in the academy."
  • 1991 - Berkeley Citation - the highest honor/award bestowed by the University of California
  • 1990 - First recipient of the Gung and Hu Award for Distinguished Service to Mathematics
  • 1972 - Lester R. Ford Award - for Mathematical foundations for mathematics, American Mathematical Monthly 78 (1971), 463-487.
  • 1964 - The Chauvenet Prize, Mathematical Association of America award to the author of an outstanding expository article on a mathematical topic by a member of the Association.

  • Henkin, Leon. 1949. "The Completeness of the First-Order Functional Calculus", Journal of Symbolic Logic. 14: 159–166.
  • Henkin, Leon. 1950. "Completeness in the theory of types", Journal of Symbolic Logic 15: 81–91.

  1. ^ Solomon Feferman on Tarski's campaigning [1], [2] explains Henkin's role as recruit and ally.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.