01 / Reading Guide
Reading Guide
Who this book is for
For philosophy and computer-science students moving from using a logical system to investigating what the system can establish. It provides a continuation after introductory formal logic, with more attention to proofs about languages and derivation systems. Readers should expect to pause over definitions rather than only perform symbol manipulation.
Prerequisites
Know propositional and first-order logic at the level of an introductory course such as forall x. Be prepared to read proofs and learn induction; no programming language is required.
What it covers
Set-theoretic foundations support a precise treatment of syntax, structures and derivations. Completeness and related results connect proofs with models, while the computation sections ask which problems a mechanical procedure can solve. Keeping the object language separate from the language used to discuss it is a recurring discipline throughout this route.
How to use it
For each theorem, write a small example of its hypotheses before following the proof. Label whether a statement concerns a formula, a derivation or a model. Reconstruct one induction without looking, and check the base case separately. When studying a machine construction, run a short input by hand before attempting the general argument about undecidability.
Edition and sources
This record follows the official Fall 2025 archived screen edition, dated in its frontmatter, rather than assigning a print ISBN to a changing build. The project page supplies other versions. Text is licensed CC BY 4.0; the cover artwork has separate conditions.
