First-Order Logic
Raymond M. Smullyan (Author)
Except for this preface, this study is completely self-contained. It is intended to serve both as an introduction to Quantification Theory and as an exposition of new results and techniques in "analytic" or "cut-free" methods. We use the term "analytic" to apply to any proof procedure which obeys the subformula principle (we think of such a procedure as "analysing" the formula into its successive components). Gentzen cut-free systems are perhaps the best known example of ana lytic proof procedures. Natural deduction systems, though not usually analytic, can be made so (as we demonstrated in [3]). In this study, we emphasize the tableau point of view, since we are struck by its simplicity and mathematical elegance. Chapter I is completely introductory. We begin with preliminary material on trees (necessary for the tableau method), and then treat the basic syntactic and semantic fundamentals of propositional logic. We use the term "Boolean valuation" to mean any assignment of truth values to all formulas which satisfies the usual truth-table conditions for the logical connectives. Given an assignment of truth-values to all propositional variables, the truth-values of all other formulas under this assignment is usually defined by an inductive procedure. We indicate in Chapter I how this inductive definition can be made explicit-to this end we find useful the notion of a formation tree (which we discuss earlier)
Ergebnisse der Mathematik und ihrer Grenzgebiete, 43, Band 43
1 online resource
9783642867187, 3642867189
858931332
Print version:
I. Propositional Logic from the Viewpoint of Analytic Tableaux
I. Preliminaries
II. Analytic Tableaux
III. Compactness
II. First-Order Logic
IV. First-Order Logic. Preliminaries
V. First-Order Analytic Tableaux
VI. A Unifying Principle
VII. The Fundamental Theorem of Quantification Theory
VIII. Axiom Systems for Quantification Theory
IX. Magic Sets
X. Analytic versus Synthetic Consistency Properties
III. Further Topics in First-Order Logic
XI. Gentzen Systems
XII. Elimination Theorems
XIII. Prenex Tableaux
XIV. More on Gentzen Systems
XV. Craig's Interpolation Lemma and Beth's Definability Theorem
XVI. Symmetric Completeness Theorems
XVII. Systems of Linear Reasoning
References
English