(Instructor: Steffen Lempp)

(Email me (@math.wisc.edu">lemppmath.wisc.edu) to request a google meeting, or to arrange another time for one.

You will need only a browser open, with microphone and speaker enabled, and possibly a camera, and I will send you a code to log in.

No in-person meetings until further notice!)

- Draft of lecture notes on Incompleteness (by Joe Miller and Mariya Soskova)
- Draft of lecture notes on Computability (by Uri Andrews and Joe Miller)
- Lecture Notes on Priority Arguments (by Steffen Lempp)
- Sections 4.4-5.3 of Chris Ash/Julia Knight: Computable structures and the hyperarithmetical hierarchy
- Robert I. Soare: Recursively enumerable sets and degrees (Chapters I-VI)
- Robert I. Soare: Recursively enumerable sets and degrees (Chapters VII-IX.3)
- Rod Downey: Computability Theory and Linear Orderings (for the two theorems from class on computable linear orderings not in Andrews-Miller, see Theorems 3.7 and 3.16)

- Stephen Kleene: Introduction to metamathematics (Ishi Press)
- Piergiorgio Odifreddi: Classical recursion theory (2 vols., Elsevier)
- Hartley Rogers: Theory of recursive functions and effective computability (MIT Press)
- Chris Ash/Julia Knight: Computable structures and the hyperarithmetical hierarchy (Elsevier)

**HW # 1 DUE 2/13:**Incompleteness Notes 1.4.9, 1.4.15, 1.4.17, 1.6.9, 1.6.10; Soare 1.4.20, II.1.24, II.3.11**HW # 2 DUE 2/27:**Incompleteness Notes 2.3.3, 2.6.6, 2.8.6, 2.8.7, 2.8.8, 2.8.9**HW # 3 DUE 3/12:**Computability Notes 1.6.9, 1.6.11, 2.3.3, 2.3.8; Soare III.1.18, III.3.8, VI.2.3**HW # 4 DUE 4/2:**Computability Notes 3.2.7, 3.2.11, 3.3.17; Soare VI.3.10, VI.5.10**HW # 5 DUE 4/11:**Computability Notes 4.1.12, 4.3.7 (= Soare V.5.8), 4.3.16, 4.3.17; Soare V.5.10**HW # 6 DUE 4/30:**Computability Notes 6.0.26, 6.0.33; Soare VII.1.6, VII.1.7, VII.2.5, VII.3.9

- TBA

Prepared by Steffen Lempp (@math.wisc.edu">lemppmath.wisc.edu)