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.KeywordsRepresentation TheoremUniversal AlgebraRepresentation ProblemCombinatory ModelCombinatory LogicThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
