Testing

upcoming:

• January 24, 2018: On the strengths of the class forcing theorem and clopen class game determinacy, Prague set theory seminar, January 2018

This will be a talk for the Prague set theory seminar, January 24, 11:00 am to about 2pm (!). Abstract. The class forcing theorem is the assertion that every class forcing notion admits corresponding forcing relations. This assertion is not provable … Continue reading
• January 25, 2018: The universal algorithm and the universal finite set, Prague 2018

This will be a talk at the Prague Gathering of Logicians & Beauty of Logic 2018, January 25-27, 2018. Abstract. The universal algorithm is a Turing machine program $e$ that can in principle enumerate any finite sequence of numbers, if run in … Continue reading
• January 27, 2018: Set-theoretic potentialism, Winter School in Abstract Analysis 2018, Hejnice, Czech Republic

This will be a tutorial lecture series for the Winter School in Abstract Analysis 2018, held in Hejnice of the Czech Republic. Abstract. I shall introduce and develop the theory of set-theoretic potentialism. A potentialist system is a collection of first-order … Continue reading
• February 16, 2018: Self reference in the universal algorithm, Ouroboros: Formal Criteria of Self-Reference in Mathematics and Philosophy, Bonn, February 2018

This will be a talk for the conference: Ouroboros: Formal Criteria of Self-Reference in Mathematics and Philosophy, held in Bonn, February 16-18, 2018. Abstract. I shall give an elementary account of the universal algorithm, due to Woodin, showing how the capacity … Continue reading

postlist: