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.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Böhm, C., Alcune proprietà delle forme β-normali del λ-κ-calcolo. Pubbl. IAC n.696 (1968)
Curry, H.B., Feys R., Combinatory Logic, North Holland Publishing Company, Amsterdam (1968)
Rosenbloom, P.C., The Elements of Mathematical Logic, Dover Publication Inc., London (1950)
Author information
Authors and Affiliations
Editor information
Rights 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