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

Authors

Wil Dekkers
Martin Bunder, University of WollongongFollow
Henk Barendregt, Radboud University Nijmegen

RIS ID

87077

Publication Details

Dekkers, W., Bunder, M. & Barendregt, H. (1998). Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus. Archive for Mathematical Logic, 37 (5-6), 327-341.

Abstract

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus.