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

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 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators or, in a more direct way, in which derivations are not translated. Both translations are closely related in a canonical way. The two direct translations turn out to be complete. The paper fulfills the program of Church [1932], [1933] and Curry [1930] to base logic on a consistent system of A-terms or combinators. Hitherto this program had failed because systems of ICL were either too weak (to provide a sound interpretation) or too strong (sometimes even inconsistent). ?

[1]  Martin W. Bunder,et al.  A deduction theorem for restricted generality , 1973, Notre Dame J. Formal Log..

[2]  Haskell B. Curry,et al.  Apparent Variables From the Standpoint of Combinatory Logic , 1933 .

[3]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[4]  Haskell B. Curry,et al.  Some Additions to the Theory of Combinators , 1932 .

[5]  William C. Frederick,et al.  A Combinatory Logic , 1995 .

[6]  A. Church.  A Set of Postulates for the Foundation of Logic , 1932 .

[7]  H B Curry,et al.  Functionality in Combinatory Logic. , 1934, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Martin W. Bunder.  Predicate calculus of arbitrarily high finite order , 1983, Arch. Math. Log..

[9]  Haskell B. Curry.  The Universal Quantifier in Combinatory Logic , 1931 .

[10]  Martin W. Bunder.  Propositional and predicate calculuses based on combinatory logic , 1974, Notre Dame J. Formal Log..

[11]  Andrzej Mostowski.  On the Rules of Proof in the Pure Functional Calculus of the First Order , 1951, J. Symb. Log..

[12]  Martin W. Bunder.  The Inconsistency of F * 21 , 1976, J. Symb. Log..

[13]  Jonathan P. Seldin,et al.  Set Theory based on Combinatory Logic. , 1970 .

[14]  P. Aczel.  Frege Structures and the Notions of Proposition, Truth and Set* , 1980 .

[15]  H. B. Curry.  Some Properties of Equality and Implication in Combinatory Logic , 1934 .

[16]  Martin W. Bunder.  A one axiom set theory based on higher order predicate calculus , 1983, Arch. Math. Log..

[17]  J. Roger Hindley,et al.  Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[18]  A. Church.  The calculi of lambda-conversion , 1941 .

[19]  H B Curry.  Some Advances in the Combinatory Theory of Quantification. , 1942, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[21]  Martin W. Bunder.  A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic , 1983, J. Symb. Log..

[22]  Haskell B. Curry.  The Inconsistency of Certain Formal Logic , 1942, J. Symb. Log..

[23]  Wouter Peremans.  Een opmerking over intuitionistische logica , 1949 .

[24]  H. B. Curry.  The inconsistency of certain formal logics , 1942, Journal of Symbolic Logic.

[25]  S. Kleene,et al.  The Inconsistency of Certain Formal Logics , 1935 .

[26]  H. B. Curry.  First Properties of Functionality in Combinatory Logic , 1935 .

[27]  M. H. Lob,et al.  Solution of a Problem of Leon Henkin , 1955, J. Symb. Log..

[28]  Haskell B. Curry,et al.  The combinatory foundations of mathematical logic , 1942, Journal of Symbolic Logic.