Abstract
The lambda-operator [λ-operator] is the most universal operator in formal languages. Before it is discussed some general remarks concerning the notion of operator will be of use.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Church, A.: A formulation of the simple theory of types. J. Symbolic Logic 5: 56–68, 1940.
Church, A., Rosser, J. B.: Some properties of X-conversion. Trans. Amer. Math. Soc. 39: 472–482, 1936.
Curry, H. B., Feys, R., Craig, W.: Combinatory logic, vol. 1. Amsterdam: North-Holland Publishing, 1958.
Curry, H. B., Hindley, J. R., Seldin, J. P.: Combinatory logic, vol. 2. Amsterdam: North-Holland Publishing 1972.
Grzegorczyk, A.: Recursive objects in all finite types. Fund. Math. 54: 73–93, 1964.
Henkin, L.: A theory of propositional types. Fund. Math. 52: 323–334, 1963.
Rosenbloom, P.: The elements of mathematical logic. New York: Dover, 1950.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Grzegorczyk, A. (1981). Lambda-Operator. In: Marciszewski, W. (eds) Dictionary of Logic as Applied in the Study of Language. Nijhoff International Philosophy Series, vol 9. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1253-8_36
Download citation
DOI: https://doi.org/10.1007/978-94-017-1253-8_36
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8257-2
Online ISBN: 978-94-017-1253-8
eBook Packages: Springer Book Archive