A Finitely Axiomatized Formalization of Predicate Calculus with Equality

We present a formalization of first-order predicate calculus with equality which, unlike traditional systems with axiom schemata or substitution rules, is finitely axiomatized in the sense that each step in a formal proof admits only finitely many choices. This formalization is primarily based on the inference rule of condensed detachment of C. A. Meredith. The usual primitive notions of free variable and proper substitution are absent, making it easy to verify proofs in a machine-oriented application. Completeness results are presented. The example of Zermelo-Fraenkel set theory is shown to be finitely axiomatized under the formalization. The relationship with resolution-based theorem provers is briefly discussed. A closely related axiomatization of traditional predicate calculus is shown to be complete in a strong metamathematical sense.

[1]  Larry Wos,et al.  Automated reasoning - 33 basic research problems , 1988 .

[2]  Jeremy George Peterson.  An automatic theorem prover for substitution and detachment systems , 1978, Notre Dame J. Formal Log..

[3]  R. Montague,et al.  On Tarski's formalization of predicate logic with identity , 1965 .

[4]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[5]  D. Monk.  Substitutionless predicate logic with identity , 1965 .

[6]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[7]  Alonzo Church,et al.  Introduction to Mathematical Logic. Volume I. , 1957 .

[8]  P. J. Cohen.  Set Theory and the Continuum Hypothesis , 1966 .

[9]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[10]  A. Tarski.  A simplified formalization of predicate logic with identity , 1964 .

[11]  J. A. Kalman.  Condensed detachment as a rule of inference , 1983 .

[12]  H. Piaggio.  Logic for Mathematicians , 1954, Nature.

[13]  Elliott Mendelson,et al.  Introduction to Mathematical Logic , 1979 .

[14]  Martin W. Bunder,et al.  Weaker D-Complete Logics , 1996, Log. J. IGPL.

[15]  J. Roger Hindley,et al.  Principal type-schemes and condensed detachment , 1990, Journal of Symbolic Logic.

[16]  L. Wos,et al.  Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving* , 1983 .

[17]  J. Donald Monk.  Review: Alfred Tarski and Steven Givant, A formalization of set theory without variables , 1989 .

[18]  David Meredith,et al.  In memoriam: Carew Arthur Meredith (1904-1976) , 1977, Notre Dame J. Formal Log..

[19]  Hans Hermes,et al.  Introduction to mathematical logic , 1973, Universitext.

[20]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

[21]  Larry Wos,et al.  Automated Reasoning: Introduction and Applications , 1984 .

[22]  F. J. Pelletier,et al.  316 Notre Dame Journal of Formal Logic , 1982 .