Mathematical logic is unusual: it turns the tools of mathematics onto mathematics itself, studying what can be proved, defined, and computed. That reflexiveness is powerful but disorienting, and it makes order essential. The famous results — Godel's incompleteness theorems above all — only make sense once the machinery of first-order logic is fully in place. Reach for them too early and they become slogans rather than theorems.
The path below builds the first-order core, works carefully through incompleteness and computability, then opens the branches of model theory and proof theory.
The first-order core
Start with A mathematical introduction to logic by Enderton, the standard, well-paced first course that develops propositional and first-order logic up through the completeness theorem with real rigor and readable prose. It gives you the syntax, semantics, and soundness/completeness machinery that everything else in the subject assumes.
Incompleteness and computability
Now approach the famous results with the tools to actually understand them. Computability and logic by Boolos, Burgess, and Jeffrey is the beloved bridge, developing computability alongside logic and building carefully to Godel's theorems. An Introduction to Gödel's Theorems by Peter Smith is the patient, dedicated treatment that unpacks incompleteness step by step, and Computability theory by Rebecca Weber is a clean introduction to what computation can and cannot do. Turing Computability by Robert Soare is the deeper, authoritative text on the theory of computation and degrees.
The major branches
The final arc opens the field's two great subdisciplines. Model Theory An Introduction by David Marker is the standard modern entry into model theory, the study of the structures that satisfy theories, and A shorter model theory by Hodges is the compact classic companion. Around classification theory of models by Shelah reaches the research frontier of that branch. On the other side, Basic Proof Theory by Troelstra and Schwichtenberg develops proof theory, the study of formal proofs as mathematical objects in their own right.
Read in this order and logic stops being a collection of paradoxes and becomes a rigorous science of reasoning. Follow the full path from first-order logic to the modern branches.
