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 the right model of PA, and furthermore, can always enumerate any desired extension of that sequence in a suitable end-extension of that model. The universal finite set is a $\Sigma_2$ definition that can in principle define any finite set, in the right model of set theory, and can always define any desired finite extension of that set in a suitable top-extension of that model. I shall give an account of both results and describe applications to the model theory of arithmetic and set theory.

Slides | Lecture notes

2 thoughts on “The universal algorithm and the universal finite set, Prague 2018

    • Ha! That was un-intentional. But the G+ post does have the lecture notes, which is what the link is for. I actually didn’t end up using those lecture notes for the actual talk, since the room did not have a suitable chalkboard, which is why I made the slides.

Leave a Reply

Your email address will not be published. Required fields are marked *