PHIL 4420 - Computability and Logic
Typical Schedule of Topics
Part I - Computability
| Date | Topic |
| Week 1 | Enumerability |
| Week 2 | Turing Machines: Computability and uncomputability |
| Week 3 | Abacus Machines and Abacus Computability |
| Week 4 | Recursive Functions |
| Week 5 | Equivalence of the different systems |
| Week 6 | Universal Turing Machines |
Part II - Logic
| Week 7 | First-Order Logic: Recap and Formal Semantics |
| Week 8 | First-Order Logic is Undecidable |
| Week 9 | First-Order Logic: Models |
| Week 10 | First-Order Logic is Complete |
Part III - Computability and Logic
| Date | Topic |
| Week 11 | Arithmetization |
| Week 12 | Definability |
| Week 13 | Representability |
| Week 14 | Godel's Incompleteness Theorem |
| Week 15 | Philosophical Implications of Godel's Incompleteness Theorem |