Abstract
Two well-known theorems of Birkhoff in Universal Algebra say that the class of models of a set of equations builds a structure called a variety, which is closed under certain operations, and that every element of a variety can be written as a subdirect product of irreducible elements of this variety [Birk35].
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
Amrhein, B., Universal Algebra in Combinatory Logic, Ph.D. thesis ETH No. 10005, ETH Zürich, (1992).
Barendreght, H.P., The Lambda Calculus, North Holland, Amsterdam, (1984).
Birkhoff, G., On the structure of abstract algebras, Proc. Cambridge Phil. Soc. 31 (1935).
Weibel, T., Extension of combinatory logic to a theory of combinatory representation, Theoret. Comput. Sci 97 (1992), 157–173.
Rights and permissions
Copyright information
© 1995 Birkhäuser Boston
About this chapter
Cite this chapter
Amrhein, B. (1995). Aspects of Universal Algebra in Combinatory Logic. In: The Combinatory Programme. Progress in Theoretical Computer Science. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4268-0_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4268-0_3
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-8716-2
Online ISBN: 978-1-4612-4268-0
eBook Packages: Springer Book Archive