This will be a talk for the Notre Dame logic seminar, 11 October 2022, 2pm in Hales-Healey Hall.

Abstract.  I shall present very new results on pointwise definable and Leibnizian end-extensions of models of arithmetic and set theory. Using the universal algorithm, I shall present a new flexible method showing that every countable model of PA admits a pointwise definable ${\mathrm{\Sigma }}_n$-elementary end-extension. Also, any model of PA of size at most continuum admits an extension that is Leibnizian, meaning that any two distinct points are separated by some expressible property. Similar results hold in set theory, where one can also achieve V=L in the extension, or indeed any suitable theory holding in an inner model of the original model.