Some consistency proofs and a characterization of inconsistency proofs in illative combinatory logic

DOI10.2307/2273864zbMath0614.03015OpenAlexW2075432129MaRDI QIDQ4722038

Martin W. Bunder

Publication date: 1987

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

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

zbMATH Keywords

inconsistency proofscut formulasillative combinatory logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Intuitionistic mathematics (03F55) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Category theory based on combinatory logic ⋮ A weak absolute consistency proof for some systems of illative combinatory logic ⋮ Some generalizations to two systems of set theory based on combinatory logic ⋮ Equivalences between pure type systems and systems of illative combinatory logic

Cites Work

• A set of postulates for the foundation of logic
• Types in combinatory logic
• A generalised Kleene-Rosser paradox for a system containing the combinator K
• 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

This page was built for publication: Some consistency proofs and a characterization of inconsistency proofs in illative combinatory logic