Date | Time | Speaker | Title | Cookies, dinner, etc. |

Tuesday, November 4 | 4:00 p.m. | Howard Becker, UW | Ancient set theory (see abstract) | cookies/ beverages at 3:30 |

Tuesday, November 11 | 4:00 p.m. | Reese Johnston, UW | Computable categoricity of uncountable linear orders (specialty exam, see abstract) | cookies/ beverages at 3:30 |

**Course Description:**
This course will serve as a survey of historical and current research in
computable model theory. There will be a focus on recursive model theory
and the model theory of models of Peano Arithmetic.

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