Abstract
First of all I must apologize for the word “concrete”; the concreteness of the model we describe is somewhat comparable with the concreteness of the field of real numbers, as constructed by Dedekind. It is thus concreteness relative to an unreflectively borrowed substratum from naive set-theory — as concrete therefore as the objects of classical mathematics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Further Reading
Barendregt, H.P.: The type free lambda calculus, in: J. Barwise: Handbook of Mathematical Logic, pp. 1091–1132, Amsterdam, North-Holland, 1977
Engeler, E.: Algebras and Combinators, Algebra Universalis 13, pp. 389–392, (1981)
Meyer, A.: What is a model of the Lambda Calculus?, Report MIT/LCS/TM-171 (resp. TM-201), 1980 (1981)
Schellinx, H.: Isomorphismus and nonisomorphisms of graph models, J. of Symbolic Logic, 56, pp. 227–249, (1991)
Longo, G.: Set-Theoretical Models of A-Calculus: Theories, Expansions, Isomorphism, Annals of Pure and Applied Logic, 24, pp- 153–188, (1983)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Engeler, E. (1993). Concrete Combinatory Algebras. In: Foundations of Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78052-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-78052-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-78054-7
Online ISBN: 978-3-642-78052-3
eBook Packages: Springer Book Archive