Formal Number Theory and Computability: A Workbook

This book forms a first short course in mathematical logic for students of mathematics, computing, and philosophy The book avoids spending excess time dpveloping propositional and predicate logic so as not be be too daunting to the beginner. It does nevertheless proceed rapidly and directly to the proof of G6del's incompleteness results for elementary number theory and various other related results. By this approach the book aims to show the student with limited time the distinctive character of mathematical logic while attracting the interest of those students who might wish to go further. The numerous exercises are an integral part of the book offering the student the chance to learn by example. An appendix of model solutions is included for reference. This integrated approach offers the student the opportu nity to make rapid progress with relatively little help from a teacher.