A weak absolute consistency proof for some systems of illative combinatory logic

DOI10.2307/2273470zbMath0527.03003OpenAlexW2159676458MaRDI QIDQ3043111

Martin W. Bunder

Publication date: 1983

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273470

zbMATH Keywords

weak consistencylambda calculusstrong consistencyillative combinatory logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Nonclassical and second-order set theories (03E70) Combinatory logic and lambda calculus (03B40)

Related Items

Systems of illative combinatory logic complete for first-order propositional and predicate calculus, Arithmetic based on the Church numerals in illative combinatory logic, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, Category theory based on combinatory logic, Some consistency proofs and a characterization of inconsistency proofs in illative combinatory logic, Some generalizations to two systems of set theory based on combinatory logic

Cites Work

• Unnamed Item
• Illative combinatory logic without equality as a primitive predicate
• Combinatory logic. Vol. II
• Progress report on generalized functionality
• Some consistency proofs and a characterization of inconsistency proofs in illative combinatory logic