Skip to main content

A Fortuitous Year with Leon Henkin

  • Chapter
The Life and Work of Leon Henkin

Part of the book series: Studies in Universal Logic ((SUL))

Abstract

This is a personal reminiscence about the work I did under the direction of Leon Henkin during the last year of my graduate studies, work that proved to be fortuitous in the absence of Alfred Tarski, my thesis advisor.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Throughout, I use “interpretable” here to mean relatively interpretable in the sense of Tarski, Mostowski, and Robinson; see [20].

  2. 2.

    Actually, a further simplification of Henkin’s argument due to Hasenjaeger (see [10]) became the preferred mode of presentation.

  3. 3.

    I was pleased to learn in 1957 that Andrzej Ehrenfeucht obtained the sought-for decidability results; he applied back-and-forth methods rather than the elimination of quantifier methods that Tarski had expected. And, as it later turned out, the basic idea of generalized powers that I had introduced to reduce the decision problem could be combined in a fruitful way with the work of my fellow student Bob Vaught on sentences preserved under Cartesian products, leading to the paper Feferman and Vaught [7] on generalized products of theories.

  4. 4.

    Years later, I learned from Steve Givant that this was the standard route for proving the representation theorem, but I have not checked the literature to see exactly how it is usually presented.

  5. 5.

    Tarski told John Corcoran that he considered himself to be “the greatest living sane logician”; cf. [1, p. 5]. My frustrations working with Tarski as a student were by no means unique as is testified to in the many stories in that biography.

  6. 6.

    See Halbach and Visser [9]. Löb [18] proved that for the standard formalization of the provability predicate, the Henkin sentence is provable in PA.

  7. 7.

    As is well known nowadays, this can be improved to arbitrary recursively enumerable extensions of the fragment Σ 1-IA of PA and even weaker theories.

  8. 8.

    See Visser [24] for a full exploration of the phenomenon of interpretability of inconsistency.

  9. 9.

    I spent the first year at Stanford writing up my thesis (see [2]) and received the Ph.D. at UC Berkeley in 1957.

  10. 10.

    Cf., e.g., Hájek and Pudlák [8, p. 2]. Incidentally, see Feferman [6, p. 177] for an explanation of why the ongoing plans to combine my thesis work with that of my fellow student, Richard Montague, in the form of a monograph were never completed.

  11. 11.

    Orey had heard me talk about my thesis work at the Institute for Symbolic Logic held at Cornell in the summer of 1957, and that led him to his theorem, which he kindly let me include in my 1960 publication; cf. also Orey [19].

References

  1. Feferman, A.B., Feferman, S.: Alfred Tarski. Life and Logic. Cambridge University Press, New York (2004)

    MATH  Google Scholar 

  2. Feferman, S.: Formal Consistency Proofs and Interpretability of Theories. Dissertation, Univ. of California at Berkeley, Berkeley (1957)

    Google Scholar 

  3. Feferman, S.: Arithmetization of metamathematics in a general setting. Fundam. Math. 49, 35–92 (1960)

    MathSciNet  MATH  Google Scholar 

  4. Feferman, S.: Transfinite recursive progressions of axiomatic theories. J. Symb. Log. 27, 259–316 (1962)

    Article  MathSciNet  Google Scholar 

  5. Feferman, S.: Systems of predicative analysis. J. Symb. Log. 29, 1–30 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  6. Feferman, S.: My route to arithmetization. Theoria 63(3), 168–181 (1997)

    Article  MathSciNet  Google Scholar 

  7. Feferman, S., Vaught, L.: The first order properties of products of algebraic systems. Fundam. Math. 47, 57–103 (1959)

    MathSciNet  MATH  Google Scholar 

  8. Hájek, P., Pudlák, P.: Metamathematics of First Order Arithmetic. Springer, Berlin (1993)

    Book  MATH  Google Scholar 

  9. Halbach, V., Visser, A.: The Henkin sentence. (This volume)

    Google Scholar 

  10. Hasenjaeger, G.: Eine Bemerkung zu Henkin’s Beweis für die Vollständigkeit des Prädikatenkalküls der ersten Stufe. J. Symb. Log. 18, 42–48 (1953)

    Article  MathSciNet  MATH  Google Scholar 

  11. Henkin, L.: The completeness of the first-order functional calculus. J. Symb. Log. 14, 159–166 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  12. Henkin, L.: A problem concerning provability. J. Symb. Log. 17, 160 (1952)

    Article  Google Scholar 

  13. Hilbert, D., Bernays, P.: Grundlagen der Mathematik, Vol. II. Springer, Berlin (1939)

    Google Scholar 

  14. Kleene, S.C.: Introduction to Metamathematics. North-Holland, Amsterdam (1952)

    MATH  Google Scholar 

  15. Kreisel, G.: On a problem of Henkin’s. Indag. Math. 15, 405–406 (1953)

    MathSciNet  Google Scholar 

  16. Lindström, P.: Some results on interpretability. In: Jensen, F.V., et al. (eds.) Proceedings of the 5th Scandinavian Logic Symposium, pp. 329–361. Aalborg Univ. Press, Aalborg (1979)

    Google Scholar 

  17. Lindström, P.: Interpretability in reflexive theories—A survey. Theoria 63(3), 182–209 (1997)

    Article  MathSciNet  Google Scholar 

  18. Löb, M.H.: Solution of a problem of Leon Henkin. J. Symb. Log. 20, 115–118 (1955)

    Article  MATH  Google Scholar 

  19. Orey, S.: Relative interpretations. Z. Math. Log. Grundl. Math. 7, 146–153 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  20. Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable Theories. North-Holland, Amsterdam (1953)

    MATH  Google Scholar 

  21. Turing, A.: Systems of logic based on ordinals. Proc. Lond. Math. Soc. 245, 161–228 (1939)

    Article  MathSciNet  Google Scholar 

  22. Wang, H.: Arithmetical models for formal systems. Methodos 3, 217–232 (1951)

    MathSciNet  Google Scholar 

  23. Visser, A.: Interpretability logic. In: Petkov, P. (ed.) Mathematical Logic, pp. 175–208. Plenum Press, New York (1990)

    Chapter  Google Scholar 

  24. Visser, A.: The interpretability of inconsistency. In: Logic Group Preprint Series, Preprint Series of the Department of Philosophy, vol. 318. Universiteit Utrecht (2014). Available via http://www.phil.uu.nl/preprints/lgps/authors/visser/

Download references

Acknowledgements

I wish to thank Anita Burdman Feferman and Albert Visser for their helpful comments on a draft of this article.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Solomon Feferman .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Feferman, S. (2014). A Fortuitous Year with Leon Henkin. In: Manzano, M., Sain, I., Alonso, E. (eds) The Life and Work of Leon Henkin. Studies in Universal Logic. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-09719-0_5

Download citation

Publish with us

Policies and ethics