University of Cambridge > Talks.cam > Set Theory Seminar > Forcing as a computational process

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Forcing as a computational process

Download to your calendar using vCal

If you have a question about this talk, please contact Benedikt Loewe .

part of STUK 1

We investigate the 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 of set theory ⟨M,∈M⟩, for example, we explain senses in which one may compute M-generic filters G⊂P∈M and the corresponding forcing extensions M[G]. Meanwhile, no such com­pu­ta­tio­nal process is functorial, for there must always be isomorphic alternative presentations of the same model of set theory M that lead by the computational process to non-isomorphic forcing extensions M[G]≆M[G′]. Indeed, there is no Borel function providing generic filters that is functorial in this sense. This is joint work with Russell Miller and Kameryn Williams.

This talk is part of the Set Theory Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

https://jbs-cam.zoom.us/j/86865549117?pwd=L1hXK3F3T0EycWI1azcrME16VEo1QT09 Top Educational apps for students Average on weekdays: 9039.30594679 kWh

Other talks

Machine Politics? Computers and AI in the History of Political Thought Online Causal Inference Seminar An Amphibious Urbanism | | Cut 4: The Desert Arrives Slowly CSAR lecture: Decarbonizing road freight (TBC) Teams Announced Alicia Anderson discussing some exciting news about HARPS3
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity