Abstract
In the early thirties, Church developed predicate calculus within a system based on lambda calculus. Rosser and Kleene developed Arithmetic within this system, but using a Godelization technique showed the system to be inconsistent.
Alternative systems to that of Church have been developed, but so far more complex definitions of the natural numbers have had to be used. The present paper based on a system of illative combinatory logic developed previously by the author, does allow the use of the Church numerals. Given a new definition of equality all the Peano-type axioms of Mendelson except one can be derived. A rather weak extra axiom allows the proof of the remaining Peano axiom. Note. The illative combinatory logic used in this paper is similar to the logic employed in computer languages such as ML.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. W. Bunder, Set Theory Based on Combinatory Logic, V.R.B., Groningen 1969.
M. W. Bunder, Propositional and predicate calculuses based on combinatory logic, Notre Dame Journal of Formal Logic, Vol. XV (1974), pp. 25–32.
M. W. Bunder, A generalised Kleene-Rosser paradox, Notre Dame Journal of Formal Logic, Vol. XIV (1973), pp. 53–54.
M. W. Bunder, A weak absolute consistency proof for some systems of illative combinatory logic, Journal of Symbolic Logic, Vol. 48 (1983), pp. 771–776.
M. W. Bunder, A one axiom set theory based on higher order predicate calculus, Archiv für Mathematische Logik und Grundlagenforschung, Vol. 23 (1983), pp. 99–107.
M. W. Bunder, Conjunction without conditions in illative combinatory logic, The Bulletin of the Section of Logic of the Polish Academy of Science, Vol. 13 (1984), pp. 207–212.
M. W. Bunder, Natural numbers in illative combinatory logic in Mathematical Logic, Ed. X. Caicedo, Proceedings of the Fifth Latin American Symposium Bogota, 1981, Revista Colombiana de Matematicas, Vol. 19 (1985), pp. 31–42.
A. Church, A set of postulates for the foundation of logic, Annals of Mathematics, (2), Vol. 33 (1932), pp. 346–366 and Vol. 34 (1933), pp. 839–864,
A. Church, The calculi of lambda-conversion, Annals of Mathematical Studies 6 Princeton N.Y. 1941; 2nd ed. 1951.
H. B. Curry and R. Feys, Combinatory Logic Vol. I, North Holland, Amsterdam 1958.
H. B. Curry, J. R. Hindley and J. P. Seldin, Combinatory Logic Vol. II, North Holland, Amsterdam 1972.
S. C. Kleene, A theory of positive integers informal logic. American Journal of Mathematics, Vol. 57 (1935), pp. 153–173, 219–244.
S. C. Kleene, Proof by cases in formal logic, Annals of Mathematics (2), Vol. 35 (1934), pp. 529–544.
S. C. Kleene and J. B. Rosser, The inconsistency of certain formal logics, Annals of Mathematics (2), Vol. 36 (1935), pp. 630–636.
E. Mendelson, Introduction to Mathematical Logic, Van Nostrand, New York 1964.
J. B. Rosser, A mathematical logic without variables, Annals of Mathematics (2), Vol. 36 (1935), pp. 127–150 and Duke Mathematical Journal, Vol. 1 (1935), pp. 328–355.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bunder, M.W. Arithmetic based on the Church numerals in illative combinatory logic. Stud Logica 47, 129–143 (1988). https://doi.org/10.1007/BF00370287
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370287