When:

September 14, 2017 @ 2:50 pm – 3:40 pm

2017-09-14T14:50:00-10:00

2017-09-14T15:40:00-10:00

Where:

Keller 402

Title: A Simple Proof of a Theorem of Woodin

Abstract: In a similar spirit as my talk last semester about computing

and non-standard models, I will relay Joel David Hamkins’ new proof of a

theorem of Woodin: that there is a function that enumerates any finite

set (if computed in the correct model M of arithmetic), and which can

enumerate any extension of that set (if run in the correct end-extension

of M).