This is a short, distinctive, modern, and motivated introduction to mathematical logic for senior undergraduate and beginning graduate students in mathematics and computer science. Any mathematician who is interested in knowing what logic is concerned with and who would like to learn Godel's incompleteness theorems should find this book particularly convenient. The treatment is thoroughly mathematical, and the entire subject has been approached like a branch of mathematics. Serious efforts have been made to make the book suitable for the classroom as well as for self-reading. The book does not strive to be a comprehensive encyclopedia of logic. Still, it gives essentially all the basic concepts and results in mathematical logic. The book prepares students to branch out in several areas of mathematics related to foundations and computability such as logic, axiomatic set theory, model theory, recursion theory, and computability. The main prerequisite for this book is the willingness to work at a reasonable level of mathematical rigor and generality.
Preface.- Syntax of first order logic.- Semantics of first-order languages.- Propositional logic.- Proof and metatheorems in first-order logic.- Completeness theorem and model theory.- Recursive functions and arithmetization of theories.- Incompleteness theorems and recursion theory.- References.- Index