No label defined (Q4023926)

This book gives a very thorough treatment of classical logic, in German, for mathematicians. It starts right away with first-order predicate logic with equality. Propositional logic is only treated separately in Chapter XI on logic programming. This chapter is new with respect to the authors' ``Mathematical logic'' (1984; Zbl 0556.03001), an English translation of the first printing (1978; Zbl 0399.03001). The text is illustrated with interesting examples from mathematics. Most (if not all) sections end with exercises; solutions of these are not given. The proof of the completeness of a sequent calculus for first- order logic is given in the Henkin way. The Löwenheim-Skolem theorems are treated in Chapter VI. Because of the restricted expressive power of first-order logic, second-order logic and logics with infinitary languages are considered in Chapter IX. The undecidability of first-order logic is shown in Chapter X via the undecidability of the halting problem for register machines. In the same chapter one finds a proof of the incompleteness of second-order logic using Trakhtenbrot's theorem, and proofs of Gödel's first and second incompleteness theorems for arithmetic. Chapter XI contains logical foundations of logic programming, including Herbrand's theorem, resolution and unification. The last Chapter (XII) contains some very interesting topics not easily to be found in other elementary logic books: the theorems of Fraissé and Ehrenfeucht, giving characterizations of elementary equivalence; and the first and second theorem of Lindström showing that first-order logic is the most expressive one which satisfies certain conditions.