This is a preview of subscription content, log in via an institution to check access.
References
Barendregt, H.P.: The λ-calculus. Its syntax and semantics. Amsterdam: North-Holland 1984
Curry, H.B., Hindley, J.R., Seldin, J.P.: Combinatory Logic. Amsterdam: North-Holland 1972
Curry, H.B., Feys, R.: Combinatory Logic, vol. 1. Amsterdam: North-Holland 1958
Engeler, E.: Algebras and combinators. Algebra Univ. 389–392 (1981)
Georgieva, N.V.: Another simplification of the recursion scheme. Arch. Math. Logik Grundlagenforsch.18, 1–3 (1976)
Grzegorczyk, A.: Recursive objects in all finite types. Fundam. Math.54, 73–93 (1964)
Grzegorczyk, A.: Axiomathic theory of enumeration (to appear)
Ivanov, L.: Algebraic recursion theory. Chichester: 1986
Plotkin, G.D.: A set theoretical definition of application. Technical Report MIP-R-95, University of Edinburgh (1972)
Rice, H.G.: Classes of recursively enumerable sets and their decision problems. Trans. Am. Math. Soc.74, 358–366 (1953)
Skordev, D.G.: The first recursion theorem for iterative combinatory spaces. Z. Math. Logik Grundlagen Math.25, 69–77 (1979)
Skordev, D.G.: Combinatory spaces and recursiveness in them. Sofia (in Russian, English summary) 1980
Zashev, J.A.: Recursion theory in partially ordered combinatory models. Dissertation. Sofia University (in Bulgarian) 1983
Zashev, J.A.: Abstract Plotkin's models. Mathematics theory of programming. Novosibirsk (in Russian) 1985
Zashev, J.A.: Recursion theory inB-combinatory algebries, Serdica, Bulg. Math. Publ.13, 224–238 (1987)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Georgieva, N. Spaces with combinators. Arch Math Logic 32, 321–339 (1993). https://doi.org/10.1007/BF01409966
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01409966