- Review of Logic
- Crieteria for completeness of axiom systems
- Review of Turing machines computability
- The recursion theorem and its uses
- Formal systems and arithmetization of syntax
- representation of recursive function in arithmetic
- Godel’s fixed-point theorem. First incompleteness theorem
- Loeb’s theorem and Godel’s second incompleteness theorem
- Additional advanced material
- University course catalogue:
- 201.1.5131
- Level:
- Advanced Undergraduate
- Credits:
- 4.0
Dependency Graph
Nodes are draggable, double click for more info