Textbook for symbolic logic, beginning at a level appropriate for beginning students, and continuing through Gödel’s completeness and incompleteness theorems. On this page you will find links to download different sections of the text (formatted for either single- or double-sided printing). There are also answers to selected exercises—these are formatted on large pages, and best viewed on a larger monitor. Consistent with the license, I am happy for anyone to use this material. And I appreciate comments—which you may make via the Textbook Blog!
From the Preface: There is, I think, a gap between what many students learn in their ﬁrst course in formal logic, and what they are expected to know for their second. . . . The aim of this text is to integrate material from these courses and, in particular, to make serious mathematical logic accessible to students I teach. The ﬁrst parts introduce classical symbolic logic as appropriate for beginning students; the last parts build to Gödel’s completeness and ıncompleteness results. A distinctive feature of the last section is a complete development of Gödel’s second ıncompleteness theorem. Complete preface/contents to the textbook.
Textbook files (ver 9.06 — July 24, 2021):
Some other useful files:
- Symbolic Logic: most recent version (July 24, 2021)
- A course of study for Symbolic Logic: assignment schedule
- Trees for sentential formulas: instructions for Symbolyzer / Symbolyzer
- Ruby recursive program files: running Ruby / recursive1.rb
- Turing machine files: running the simulator / state.rb / turing_machine.rb / suc.rb / blank.rb
- If you are interested in LaTeX: getting started with LaTeX / test.tex / preamble.tex
Symbolic Logic: An Accessible Introduction to Serious Mathematical Logic by Tony Roy is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.