Self reference in computability theory and 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 for self-reference in arithmetic gives rise to a Turing machine program $e$, which provably enumerates a finite set of numbers, but which can in principle enumerate any finite set of numbers, when it is run in a suitable model of arithmetic. Furthermore, the algorithm can successively enumerate any desired extension of the sequence, when run in a suitable top-extension of the universe. Thus, the algorithm sheds some light on the debate between free will and determinism, if one should imagine extending the universe into a nonstandard time scale. An analogous result holds in set theory, where Woodin and I have provided a universal locally definable finite set, which can in principle be any finite set, in the right universe, and which can furthermore be successively extended to become any desired finite superset of that set in a suitable top-extension of that universe.

Ouroboros Bonn 2018 Conference Poster | Slides

Regula Krapf, Ph.D. 2017, University of Bonn

Regula Krapf successfully defended her PhD dissertation January 12, 2017 at the University of Bonn, with a dissertation entitled, “Class forcing and second-order arithmetic.”  I was a member of the dissertation examining committee. Peter Koepke was the dissertation supervisor.

Regula Krapf

Regula Krapf, Class forcing and second-order arithmetic, dissertation 2017, University of Bonn. (Slides)

Abstract. We provide a framework in a generalization of Gödel-Bernays set theory for performing class forcing. The forcing theorem states that the forcing relation is a (definable) class in the ground model (definability lemma) and that every statement that holds in a class-generic extension is forced by a condition in the generic filter (truth lemma). We prove both positive and negative results concerning the forcing theorem. On the one hand, we show that the definability lemma for one atomic formula implies the forcing theorem for all formulae in the language of set theory to hold. Furthermore, we introduce several properties which entail the forcing theorem. On the other hand, we give both counterexamples to the definability lemma and the truth lemma. In set forcing, the forcing theorem can be proved for all forcing notions by constructing a unique Boolean completion. We show that in class forcing the existence of a Boolean completion is essentially equivalent to the forcing theorem and, moreover, Boolean completions need not be unique.

The notion of pretameness was introduced to characterize those forcing notions which preserve the axiom scheme of replacement. We present several new characterizations of pretameness in terms of the forcing theorem, the preservation of separation, the existence of nice names for sets of ordinals and several other properties. Moreover, for each of the aforementioned properties we provide a corresponding characterization of the Ord-chain condition.

Finally, we prove two equiconsistency results which compare models of ZFC (with large cardinal properties) and models of second-order arithmetic with topological regularity properties (and determinacy hypotheses). We apply our previous results on class forcing to show that many important arboreal forcing notions preserve the $\Pi^1_1$-perfect set property over models of second-order arithmetic and also give an example of a forcing notion which implies the $\Pi^1_1$-perfect set property to fail in the generic extension.

Regula has now taken up a faculty position at the University of Koblenz.

Set-theoretic geology and the downward directed grounds hypothesis, Bonn, January 2017

This will be a talk for the University of Bonn Logic Seminar, Friday, January 13, 2017, at the Hausdorff Center for Mathematics.

hausdorff-center-bonn

Abstract. Set-theoretic geology is the study of the set-theoretic universe $V$ in the context of all its ground models and those of its forcing extensions. For example, a bedrock of the universe is a minimal ground model of it and the mantle is the intersection of all grounds. In this talk, I shall explain some recent advances, including especially the breakthrough result of Toshimichi Usuba, who proved the strong downward directed grounds hypothesis: for any set-indexed family of grounds, there is a deeper common ground below them all. This settles a large number of formerly open questions in set-theoretic geology, while also leading to new questions. It follows, for example, that the mantle is a model of ZFC and provably the largest forcing-invariant definable class. Strong downward directedness has also led to an unexpected connection between large cardinals and forcing: if there is a hyper-huge cardinal $\kappa$, then the universe indeed has a bedrock and all grounds use only $\kappa$-small forcing.

Slides

Transfinite game values in infinite chess, including new progress, Bonn, January 2017

This will be a talk January 10, 2017 for the Basic Notions Seminar, aimed at students, post-docs, faculty and guests of the Mathematics Institute, University of Bonn.

Bishop gateway terminals

Bishop cannon

 

 

 

 

 

 

 

 

Abstract. I shall give a general introduction to the theory of infinite games, using infinite chess — chess played on an infinite edgeless chessboard — as a central example. Since chess, when won, is won at a finite stage of play, infinite chess is an example of what is known technically as an open game, and such games admit the theory of transfinite ordinal game values. I shall exhibit several interesting positions in infinite chess with very high transfinite game values. The precise value of the omega one of chess is an open mathematical question.  This talk will include some of the latest progress, which includes a position with game value $\omega^4$.

It happens that I shall be in Bonn also for the dissertation defense of Regula Krapf, who will defend the same week, and who is one of the organizers of the seminar.

Transfinite game values in infinite chess | The mate-in-$n$ problem of infinite chess is decidable | A position in infinite chess with game value $\omega^4$ | more on infinite chess | Slides

Transfinite game values in infinite chess and other infinite games, Hausdorff Center, Bonn, May 2014

Releasing the hordesI shall be very pleased to speak at the colloquium and workshop Infinity, computability, and metamathematics, celebrating the 60th birthdays of Peter Koepke and Philip Welch, held at the Hausdorff Center for Mathematics May 23-25, 2014 at the Universität Bonn.  My talk will be the Friday colloquium talk, for a general mathematical audience.

Abstract. I shall give a general introduction to the theory of infinite games, using infinite chess—chess played on an infinite edgeless chessboard—as a central example. Since chess, when won, is won at a finite stage of play, infinite chess is an example of what is known technically as an open game, and such games admit the theory of transfinite ordinal game values. I shall exhibit several interesting positions in infinite chess with very high transfinite game values. The precise value of the omega one of chess is an open mathematical question.

 

Slides | Schedule | Transfinite game values in infinite chess | The mate-in-n problem of infinite chess is decidable

An introduction to Boolean ultrapowers, Bonn, 2011

A four-lecture tutorial on the topic of Boolean ultrapowers at the Young Set Theory Workshop at the Hausdorff Center for Mathematics in Königswinter near Bonn, Germany,  March 21-25, 2011.

Boolean ultrapowers generalize the classical ultrapower construction on a power-set algebra to the context of an ultrafilter on an arbitrary complete Boolean algebra. Closely related to forcing and particularly to the use of Boolean-valued models in forcing, Boolean ultrapowers were introduced by Vopenka in order to carry out forcing as an internal ZFC construction, rather than as a meta-theoretic argument as in Cohen’s approach. An emerging interest in Boolean ultrapowers has arisen from a focus on the well-founded Boolean ultrapowers as large cardinal embeddings.

Historically, researchers have come to the Boolean ultrapower concept from two directions, from set theory and from model theory. Exemplifying the set-theoretic perspective, Bell’s classic (1985) exposition emphasizes the Boolean-valued model $V^{\mathbb{B}}$ and its quotients $V^{\mathbb{B}}/U$, rather than the Boolean ultrapower $V_U$ itself, which is not considered there. Mansfield (1970), in contrast, gives a purely algebraic, forcing-free account of the Boolean ultrapower, emphasizing its potential as a model-theoretic technique, while lacking the accompanying generic objects.

The unifying view I will explore in this tutorial is that the well-founded Boolean ultrapowers reveal the two central concerns of set-theoretic research–forcing and large cardinals–to be two aspects of a single underlying construction, the Boolean ultrapower, whose consequent close connections might be more fruitfully explored. I will provide a thorough introduction to the Boolean ultrapower construction, while assuming only an elementary graduate student-level familiarity with set theory and the classical ultrapower and forcing techniques.

ArticleAbstract | Lecture Notes