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

DOI10.2307/2273470zbMath0527.03003MaRDI 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 consistency; lambda calculus; strong consistency; illative combinatory logic

Mathematics Subject Classification ID

03F05: Cut-elimination and normal-form theorems

03E70: Nonclassical and second-order set theories

03B40: Combinatory logic and lambda calculus

Related Items

Systems of illative combinatory logic complete for first-order propositional and predicate calculus, 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, 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

Cites Work

• 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
• Unnamed Item