Skip to main content

Reflections on a Theorem of Henkin

  • Chapter
The Life and Work of Leon Henkin

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

  • 710 Accesses

Abstract

The λδ-calculus is the λ-calculus augmented with a discriminator which distinguishes terms. We consider the simply typed λδ-calculus over one atomic type variable augmented additionally with an existential quantifier and a description operator, all of lowest type. First we provide a proof of a folklore result which states that a function in the full type structure of [n] is λδ-definable from the description operator and existential quantifier if and only if it is symmetric, that is, fixed under the group action of the symmetric group of n elements. This proof uses only elementary facts from algebra and a way to reduce arbitrary functions to functions of lowest type via a theorem of Henkin. Then we prove a necessary and sufficient condition for a function on [n] to be λδ-definable without the description operator or existential quantifier, which requires a stronger notion of symmetry.

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

References

  1. Andrews, P.B.: General models, descriptions, and choice in type theory. J. Symb. Log. 37(2), 385–394 (1972)

    Article  MATH  Google Scholar 

  2. Barengregt, H., Dekkers, W., Statman, R.: Lambda Calculus with Types. Cambridge University Press, Cambridge (2011)

    Google Scholar 

  3. Church, A.: A formulation of the simple theory of types. J. Symb. Log. 5(2), 56–68 (1940)

    Article  MathSciNet  Google Scholar 

  4. Henkin, L.: A theory of propositional types. Fundam. Math. 52(3), 323–344 (1963)

    MathSciNet  MATH  Google Scholar 

  5. Läuchli, H.: An abstract notion of realizability for which intuitionistic predicate calculus is complete. Stud. Logic Found. Math. 60, 227–234 (1970)

    Article  Google Scholar 

  6. Statman, R.: Completeness, invariance and lambda-definability. J. Symb. Log. 47(1), 17–26 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  7. Statman, R.: Church’s lambda delta calculus. In: Logic for Programming and Automated Reasoning, pp. 293–307. Springer, Berlin (2000)

    Chapter  Google Scholar 

  8. van Benthem, J., Doets, K.: Higher-order logic. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn. vol. 1, pp. 189–244. Springer, Berlin (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to William Gunther .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Gunther, W., Statman, R. (2014). Reflections on a Theorem of 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_14

Download citation

Publish with us

Policies and ethics