Skip to main content

A condition for identifying two elements of whatever model of combinatory logic

  • Conference paper
  • First Online:
λ-Calculus and Computer Science Theory (LCCST 1975)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 37))

Included in the following conference series:

Abstract

The purpose of this work is to show a necessary and sufficient condition by which two combinators (elements of a particular model of combinatory logic) can be identified without introducing contradictions with the axioms of combinatory logic itself.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Böhm, C., Alcune proprietà delle forme β-normali del λ-κ-calcolo. Pubbl. IAC n.696 (1968)

    Google Scholar 

  2. Curry, H.B., Feys R., Combinatory Logic, North Holland Publishing Company, Amsterdam (1968)

    Google Scholar 

  3. Rosenbloom, P.C., The Elements of Mathematical Logic, Dover Publication Inc., London (1950)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

C. Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jacopini, G. (1975). A condition for identifying two elements of whatever model of combinatory logic. In: Böhm, C. (eds) λ-Calculus and Computer Science Theory. LCCST 1975. Lecture Notes in Computer Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029527

Download citation

  • DOI: https://doi.org/10.1007/BFb0029527

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07416-8

  • Online ISBN: 978-3-540-37944-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics