- PDF of Syllabus
- Turing Machine Simulator Note that the machines this program constructs are somewhat different from the ones we use. In particular, they allow a single instruction both to write a new symbol and, optionally, to move the head. So instructions come in the form not of quadrupes but of quintuples: OLD STATE, SCANNED SYMBOL, WRITE/ERASE, LEFT/RIGHT/STAY, NEW STATE. But it is still useful for experimenting.
- Coding Turing Machine Computations
- Compactness Summary
- Proof of the Closure Lemma
- The Simplified Sequent Calculus
- Theories and Related Notions
- Theories of Arithmetic
- The Fixed Point Theorem

If you have not previously had any logic, you will need to do some catch-up along the way, and definitely when we get to that material. Here are some online textbooks, or something of the sort, that might help.

- blogic, by David Velleman
- forall
*x*, by P. D. Magnus - A Modern Formal Logic Primer, by Paul Teller
- Symbolic Logic: A First Course, by Gary Hardegree