At the intersection of mathematics, computer science, and philosophy, mathematical logic examines the power and limitations of formal mathematical thinking. In this expansion of Leary’s user-friendly 1st edition, readers with no previous study in the field are introduced to the basics of model theory, proof theory, and computability theory. The text is designed to be used either in an upper division undergraduate classroom, or for self study. Updating the 1st Edition’s treatment of languages, structures, and deductions, leading to rigorous proofs of Gödel’s First and Second Incompleteness Theorems, the expanded 2nd Edition includes a new introduction to incompleteness through computability as well as solutions to selected exercises.
- No image available1: Structures and Languages
- No image available2: Deductions
- No image available3: Completeness and Compactness
- No image available4: Incompleteness From Two Points of View
- No image available5: Syntactic Incompleteness - Groundwork
- No image availableChapter 6: The Incompleteness Theorems
- No image availableChapter 7
- No image availableChapter 8
Thumbnail: P. Oxy. 29, one of the oldest surviving fragments of Euclid's Elements, a textbook used for millennia to teach proof-writing techniques. The diagram accompanies Book II, Proposition 5. Image used with permission (Public Domain).