Christopher C. Leary and Lars Kristiansen
| Digital versions | |
| Source available | No |
| Exercises | Yes |
| Solutions | Solutions for many of the exercises |
| License | Creative Commons Attribution-NonCommercial-ShareAlike |
- 380 pages (PDF) and 8 chapters for a one semester course
- Print version for about $30 from Lulu or Amazon
- Second edition (2015) with new material on computability
- First edition published by Prentice Hall in 2000
- Detailed favorable review from MAA Reviews
- For more information and to download
This book is written for upper division mathematics students with the aim of getting to and understanding the incompleteness theorems in a single semester. The authors outline two paths to this goal as described in the preface to the second edition:
This has allowed us to chart two paths to the incompleteness theorems, splitting after the material in Chapter 4. Readers of the first edition will find that the exposition in Chapters 5 and 6 follows a familiar route, although the material there has been pretty thoroughly reworked. It is also possible, if you choose, to move directly from Chapter 4 to Chapter 7 and see a development of computability theory that covers the Entschei- dungsproblem, Hilbert’s 10th Problem, and Gödel’s First Incompleteness Theorem.
Contents
- Structures and Languages
- Deductions
- Completeness and Compactness
- Incompleteness from Two Points of View
- Syntactic Incompleteness—Groundwork
- The Incompleteness Theorems
- Computability Theory
- Summing Up, Looking Ahead
