Southern Wisconsin Logic Colloquium

SWLC Schedule

Refreshments will be served in the 9th floor lounge a half hour before talks. Please check the schedule below. All talks will be in 901 Van Vleck Hall unless stated otherwise.

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

Math 873 - Fall 2014 - Recursive Model Theory

Instructor: Uri Andrews

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.

Math 975 - Reading Seminar in Logic

Our reading seminar is meeting on Wednesdays at 3:30 in room B231 Van Vleck Hall.

Abstracts of talks

Becker's talk: Ancient set theory

This talk concerns a 1903 theorem of G. H. Hardy and a more recent question of Peter Nyikos regarding its converse. We answer Nyikos's question by producing a model of (ZF + ω1 is regular + there exists an uncountable wellorderable set of reals + there does not exist a ladder system).

Johnston's talk: Computable categoricity of uncountable linear orders

In the context of computability in ω1, we investigate the recursive properties of uncountable linear orders. In particular, I will present a result of Greenberg, Kach, Lempp, and Turetsky determining the linear orders of size 1 that are computably categorical.


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