03159nmm a2200277 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100002500139245007100164250001700235260006300252300003200315505075500347653002301102653003901125710003401164041001901198989003801217490010601255856007201361082001001433520143801443EB000678011EBX0100000000000000053109300000000000000.0cr|||||||||||||||||||||140122 ||| eng a97836428671871 aSmullyan, Raymond R.00aFirst-Order LogichElektronische Ressourcecby Raymond R. Smullyan a1st ed. 1968 aBerlin, HeidelbergbSpringer Berlin Heidelbergc1968, 1968 aXII, 160 pbonline resource0 aI. 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 aMathematical logic aMathematical Logic and Foundations2 aSpringerLink (Online service)07aeng2ISO 639-2 bSBAaSpringer Book Archives -20040 aErgebnisse der Mathematik und ihrer Grenzgebiete. 2. Folge, A Series of Modern Surveys in Mathematics uhttps://doi.org/10.1007/978-3-642-86718-7?nosfx=yxVerlag3Volltext0 a511.3 aExcept 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)