This book is a course in Mathematical Logic. It is divided into four chapters which can be taught in two semesters. The first two chapters provide a basic background in mathematical logic. All details are explained for students not so familiar with the abstract method used in mathematical logic. The last two chapters are more sophisticated, and here we assume that the reader will be able to fill in more details; in fact, this ability is an essential step for this sphere of mathematical thinking.
Mathematical logic is the most abstract branch of mathematical thought, the most abstract human discipline. The main objective in this area is to understand the logic implicit in all mathematical thought. The difference between logic (considered as a branch of philosophy) and mathematical logic is that in mathematical logic we use and develop mathematical methods. That is, we use mathematical theorems to investigate and explain the logic implicit in mathematics. It should be clear that some of the results can also shed light on more general questions in epistemology and philosophy of science, but this is not the subject of this book. The main result in basic mathematical logic is that every "reasonable" mathematical system is intrinsically incomplete. This means that axiom systems cannot capture all semantical truths. This can also be expressed in the following way: If we assume that the human mind works in a way similar to an ideal computer, then there are mathematical problems which can never be solved by mathematicians. This is one aspect of Godel's famous incompleteness theorem, and the study of this phenomenon of incompleteness will be the main focus of this book. We think that the material of this book should be part of the basic background of every student in any discipline which employs deductive and formal reasoning as a part of its methodology. This definitely includes a large part of the social sciences.
Author(s): Martin Goldstern, Haim Judah
Publisher: A K Peters
Year: 1998
Language: English
Commentary: Scanned, DjVu'ed, OCR, TOC by Envoy
Pages: 261
City: Natick, Massachusetts
Cover ......Page 1
Contents ......Page 6
Foreword ......Page 8
Introduction ......Page 10
1.1. Induction ......Page 14
1.2. Sentential Logic ......Page 37
1.3. First Order Logic ......Page 54
1.4. Proof Systems ......Page 89
2.1. Enumerability ......Page 108
2.2. The Completeness Theorem ......Page 123
2.3. Nonstandard Models of Arithmetic ......Page 133
3.0. Introduction ......Page 144
3.1. Elementary Substructures and Chains ......Page 148
3.2. Ultraproducts and Compactness ......Page 161
3.3. Types and Countable Models ......Page 171
4.0. Introduction ......Page 200
4.1. The Language of Peano Arithmetic ......Page 202
4.2. The Axioms of Peano Arithmetic ......Page 204
4.3. Basic Theorems of Number Theory in PA ......Page 208
4.4. Encoding Finite Sequences of Numbers ......Page 217
4.5. Gödel Numbers ......Page 222
4.6. Substitution ......Page 227
4.7. The Incompleteness Theorem ......Page 229
4.8. Other Axiom Systems ......Page 232
4.9. Bounded Formulas ......Page 234
4.10. A Finer Analysis of 4.4 and 4.5 ......Page 243
4.11. More on Recursive Sets and Functions ......Page 247
Index ......Page 256
List of symbols ......Page 260
Back cover ......Page 265
