No label defined (Q4239317)

This is a concise, and well written introduction into propositional as well as first-order logic. It concentrates on the core results, and adds a lot of further -- and also important -- facts in extended exercises. At first, both kinds of classical logic are introduced from the semantical point of view. Logical calculi together with the corresponding completeness results are given at a later stage. These calculi adapt the core ideas of calculi of natural deduction, and present them via simple sequences of the form \(\Sigma\vdash H\), with \(\Sigma\) a finite set of formulas. At the very beginning there is a chapter which introduces the basic notions of set theory, and which explains the various types of proofs by induction which are used later on. The basic results on classical logic are accompanied by chapters on cardinals, on the expressive limitations of first-order logic, and on decidability results. In the final chapter the author touches topics like Löwenheim-Skolem theorems, categoricity in power, nonstandard models of arithmetic, quantifier elimination, and Gödel's first incompleteness theorem -- of course usually without proofs. This book can be well recommended as a basic text for an introductory course in classical formal logic, for students in mathematics and computer science as well as for interested philosophers and theoretical linguists.