No label defined (Q4339021)

This textbook consists of two parts. Part I presents an essentially mathematical introduction to mathematical logic at graduate level, while Part II, written at an advanced level, contains a number of famous theorems, crucial in the development of mathematics and mathematical logic. Chapters 1 to 4 are devoted to the theory of relational structures and include some elements of the theory of Boolean algebras. In Chapters 5 to 7 the fundamental notions, such as formulae, the truth relation, theories and models, are introduced. Chapters 8 to 10 deal with syntactical aspects of first-order classical logic. Chapter 11 contains the Gödel completeness theorem for first-order logic. Part I ends with Chapters 12 to 17 related to model theoretic topics, such as definability, models of Peano arithmetic, Löwenheim-Skolem theorems, ultraproducts, realization, omitting types etc. Part II starts with celebrated Gödel's incompleteness theorems (Chapters 18 to 21). In Chapter 22, the independence result of Goodstein's theorem from Peano arithmetic is presented. Chapter 23 is devoted to Tarski's theorem on quantifier elimination in the theory of real closed fields. The subject of Chapter 24 is Matiyasevich's theorem on diophantine relations. Complete and precise proofs of all the above-mentioned theorems are given. Although the material in the second part is substantially more advanced than in the first one, the authors have maintained the same spirit of freshness of presentation. These chapters could hardly be better. The book is extremely clearly written and ideally suited for a serious introductory course on the subject, requiring just standard familiarity with the basic general algebra notions. Each chapter contains selected exercises, some supplied with helpful solution hints. This book may be recommended not only to advanced students of mathematics, computer science and logic, but also to those mathematicians looking for a clear mathematical approach to celebrated theorems of mathematical logic.