scientific article; zbMATH DE number 108465
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.
- A concise introduction to mathematical logic
- A concise introduction to mathematical logic
- Mathematical Logic
- scientific article; zbMATH DE number 46338
- scientific article; zbMATH DE number 777408
- Introduction to mathematical logic
- Mathematical logic. With a preface by A. Szerzo.
- scientific article; zbMATH DE number 1521608
- scientific article; zbMATH DE number 193626
- Gödel's completeness theorem
- Extending partial isomorphisms and McAlister's covering theorem
- Learning power and language expressiveness.
- Transition of consistency and satisfiability under language extensions
- The Gödel completeness theorem for uncountable languages
- Logic. The short method
- scientific article; zbMATH DE number 3115105 (Why is no real title available?)
- scientific article; zbMATH DE number 3170717 (Why is no real title available?)
- scientific article; zbMATH DE number 3873290 (Why is no real title available?)
- Introduction to formal logics. (Introduzione alla logica formale)
- scientific article; zbMATH DE number 107814 (Why is no real title available?)
- Graph connectivity, monadic NP and built-in relations of moderate degree
- scientific article; zbMATH DE number 3296220 (Why is no real title available?)
- scientific article; zbMATH DE number 3030935 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023926)
