Arithmetic based on the Church numerals in illative combinatory logic

DOI10.1007/BF00370287zbMath0664.03015OpenAlexW1981618715MaRDI QIDQ1115414

Martin W. Bunder

Publication date: 1988

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00370287

zbMATH Keywords

ArithmeticChurch numeralsillative combinatory logicPeano-type axioms of Mendelsonpredecessor relation

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Proof by cases in formal logic
• A mathematical logic without variables. I
• The inconsistency of certain formal logics
• A weak absolute consistency proof for some systems of illative combinatory logic
• A one axiom set theory based on higher order predicate calculus
• A Theory of Positive Integers in Formal Logic. Part I
• Contributions to the Theory of Optimal Control. A General Procedure for the Computation of Switching Manifolds
• Propositional and predicate calculus based on combinatory logic
• Various systems of set theory based on combinatory logic

This page was built for publication: Arithmetic based on the Church numerals in illative combinatory logic