Joel David Hamkins: Set-theoretic forcing as a computational process

This was a talk by Joel David Hamkins for the Midwest Computability Seminar at the University of Chicago, May 2, 2023, taking place in "The Barn" at the University of Chicago.
Abstract. I shall explore several senses in which set-theoretic forcing can be seen as a computational process on the models of set theory. Given an oracle for the atomic or elementary diagram of a model (M,∈^M) of set theory, for example, there are senses in which one may compute M-generic filters G⊂ℙ∈M over that model and compute the diagrams of the corresponding forcing extensions M[G]. Meanwhile, no such computational process is functorial, for there must always be isomorphic alternative presentations of the same model of set theory that lead by the computational process to non-isomorphic forcing extensions. Indeed, there is no Borel function providing generic filters that is functorial in this sense. This is joint work with myself, Russell Miller and Kameryn Williams.
The paper is available on the arxiv at arxiv.org/abs/....
Further commentary available at the speaker's blog jdh.hamkins.org....
The seminar web page is available at www.math.uchic....

[@patrickwall944]

Thanks for the new lecture! Love your philosophy of math book, the proof book, and even your travelogue/diary the mathematician’s year in Japan - I found it very evocative. Excited for your next book!

[@tmendoza6]

Thank you for Sharing

[@dublingranam3489]

Thank you for sharing, I hope you keep sharing content but please improve the audio 😅

[@joeldavidhamkins5484]

I apologize for this. The video was recorded by the conference organizers.

[@cyndybae6024]

I NEED HELP WITH SPOMETHING DISTURBING MY HEAD PROFESSOR

[@bobvance9519]

lol

[@lovpiliv3732]

🫡