Combinatory recursive objects of all finite types
HTML articles powered by AMS MathViewer
- by Haskell B. Curry PDF
- Bull. Amer. Math. Soc. 70 (1964), 814-817
References
- A. Grzegorczyk, Recursive objects in all finite types, Fund. Math. 54 (1964), 73–93. MR 160715, DOI 10.4064/fm-54-1-73-93
- Haskell B. Curry and Robert Feys, Combinatory logic. Vol. I, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1958. MR 0094298
- Alonzo Church, A set of postulates for the foundation of logic, Ann. of Math. (2) 34 (1933), no. 4, 839–864. MR 1503136, DOI 10.2307/1968702
- Haskell B. Curry, The paradox of Kleene and Rosser, Trans. Amer. Math. Soc. 50 (1941), 454–516. MR 5275, DOI 10.1090/S0002-9947-1941-0005275-6 5. Bruce Lercher, Strong reduction and recursion in combinatory logic, Thesis, The Pennsylvania State University, University Park, Pa., 1963.
Additional Information
- Journal: Bull. Amer. Math. Soc. 70 (1964), 814-817
- DOI: https://doi.org/10.1090/S0002-9904-1964-11245-3
- MathSciNet review: 0181566