Abstract
Combinatory algebras are models of Combinatory Logic (CL); they are algebras that are combinatory complete; i.e., they satisfy the principle of combinatory abstraction.1 As Engeler pointed out in the introductory chapter, suitably rich models of combinatory logic may serve as universes for a big variety of mathematical activities, from algebra to numerical analysis.
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.
References
Barendregt, H.P., The Lambda Calculus, North-Holland, Amsterdam, 1984.
Beeson, M.J., Foundations of Constructive Mathematics. Springer-Verlag, Berlin, 1985.
Bishop, E., Foundations of Constructive Analysis, McGraw-Hill, New York, 1967.
Engeler, E., Representation of varieties in combinatory algebras, Algebra Universalis, 25: 85–95, 1988.
Weibel, T. Some Representation Problems in Combinatory Logic, Ph.D. thesis, No. 8903, ETH-Zürich, 1989.
Weibel, T., Extension of combinatory logic to a theory of combina- tory representation, Theoret. Comput. Sci 97 (1992), 157–173.
Rights and permissions
Copyright information
© 1995 Birkhäuser Boston
About this chapter
Cite this chapter
Weibel, T. (1995). Axiomatic Extensions. In: The Combinatory Programme. Progress in Theoretical Computer Science. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4268-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4268-0_2
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-8716-2
Online ISBN: 978-1-4612-4268-0
eBook Packages: Springer Book Archive