Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus

DOI10.1007/s001530050102zbMath0908.03016OpenAlexW2159511425MaRDI QIDQ1267843

Wil Dekkers, Hendrik Pieter Barendregt, Martin W. Bunder

Publication date: 7 March 1999

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

consistencycompletenesslambda calculusillative combinatory logic

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

Pure type systems with more liberal rules, Higher-Order Illative Combinatory Logic