A mathematical introduction to logic. (Q2703808)

The first edition of this book (1972; Zbl 0298.02002) is one of the most popular textbooks for a serious upper undergraduate and beginning graduate courses covering predicate logic (up to the completeness theorem) and computability (up to undecidability and the incompleteness theorems) with detailed definitions and proofs. The second edition preserves the bulk of the material and the general approach. Additions (in most cases restricted to several sentences) are made mainly to explain or motivate the exposition and to indicate computer science connections. An example is the expanded preview of incompleteness and undefinability in arithmetic that distinguishes between the self-reference approach, the diagonalization approach and the computability approach. This textbook is likely to preserve its prominent position despite the appearance of numerous competitors.