Systems of illative combinatory logic complete for first-order propositional and predicate calculus

DOI10.2307/2275096zbMath0791.03006OpenAlexW2112160811MaRDI QIDQ4276020

Wil Dekkers, Hendrik Pieter Barendregt, Martin W. Bunder

Publication date: 7 July 1994

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

Full work available at URL: https://ro.uow.edu.au/eispapers/1959

zbMATH Keywords

consistencycompletenesslambda calculusillative combinatory logic

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (3)

Pure type systems with more liberal rules ⋮ Completeness of the propositions-as-types interpretation of intuitionistic logic into illative combinatory logic ⋮ Higher-Order Illative Combinatory Logic

Cites Work

• Unnamed Item
• The universal quantifier in combinatory logic
• A set of postulates for the foundation of logic
• Apparent variables from the standpoint of combinatory logic
• Some properties of equality and implication in combinatory logic
• A deduction theorem for restricted generality
• Combinatory logic. Vol. II
• The inconsistency of certain formal logics
• A weak absolute consistency proof for some systems of illative combinatory logic
• Solution of a problem of Leon Henkin
• Predicate calculus of arbitrarily high finite order
• A one axiom set theory based on higher order predicate calculus
• Some Additions to the Theory of Combinators
• Functionality in Combinatory Logic
• The combinatory foundations of mathematical logic
• Some Advances in the Combinatory Theory of Quantification
• The inconsistency of certain formal logics

This page was built for publication: Systems of illative combinatory logic complete for first-order propositional and predicate calculus