Set Theory Seminar

Tao’s metastability, going back to Kreisel and Goedel, is a notion of convergence with nice computational properties. The trade-off involved in metastability is that one obtains uniform and effective information, but only about a finite (but arbitrarily large) domain. We apply this metastability trade-off, i.e. introducing finite domains to yield uniform and effective results, to concepts other than convergence. This results in theorems requiring full second order arithmetic for a proof. We obtain similar results for another notion inspired by proof theory, namely uniform theorems, in which the objects claimed to exist depend on few of the parameters in the theorem.

There has been some interest recently in nonamalgamability phenomena between countable models of set theory, and forcing extensions of a fixed model in particular. Nonamalgamability is typically achieved by coding some forbidden object between a collection of models in such a way that each model on its own remains oblivious, but some combination of them can recover the forbidden information.

In this talk we will examine the problem of coding arbitrary information into a generic filter, focusing on two particular examples. First, I will present some results of joint work with Jonathan Verner where we consider surgical modifications to Cohen reals and sets of indices where such modifications are always possible. Later, I will discuss a recent result of S. Friedman and Hathaway where they achieve, using different coding, nonamalgamability between arbitrary countable models of set theory of the same height.

Suppose every (definable) set of real numbers has the Ramsey property and (definable) relations on the real numbers can be uniformized by a function on a set which is comeager in the Ellentuck topology. Then there are no (definable) MAD families. As it turns out, there are also no (fin x fin)-MAD families, where fin x fin is the two-dimensional Fubini product of the ideal of finite sets. We also comment on work in progress regarding higher dimensional products. All results are joint work with Asger Törnquist.

We will present our recent work on Jensen's class of subcomplete forcing notions and some of its variants. Of particular interest to us will be models of the Subcomplete Forcing Axiom, SCFA. This axiom implies many of the more striking consequences of MM such as SCH and the failure of $\square_\kappa$ for all uncountable $\kappa$ (both of which are due to Jensen). However, in stark contrast to MM (and its weaker variants like PFA and MA), the natural model of SCFA satisfies not only CH but in fact $\diamondsuit$. As a result SCFA is consistent with many of the consequences of $\diamondsuit$ often ruled out by forcing axioms such as the existence of Souslin trees. Indeed it seems that nearly all consequences of MM that are known not to follow from SCFA do not follow simply because of the consistency of SCFA with $\diamondsuit$ or CH. This leads to many questions of the form: given a statement that is consistent with SCFA, but inconsistent with MM, is it equivalent to CH or $\diamondsuit$ modulo ZFC $+$ SCFA? For example, does SCFA + $\neg$CH imply there are no Souslin trees?

In our talk we will show that the answer to this question and many related ones is 'no'. Our proof introduces two new classes of forcings notions, called $\infty$-subproper and $\infty$-subcomplete respectively, which generalize Jensen's original discoveries. Each class is iterable by nice iterations in the sense of Miyamoto. We'll discuss these results as well as show how to use the iteration theorems to construct several new models of SCFA $+$ $\neg$CH, many of which are as striking as the natural model of SCFA $+$ $\diamondsuit$. This includes models of SCFA $+$ $\neg$CH with Souslin trees and models of SCFA where $\mathfrak{d} = \aleph_1 < \mathfrak{c} = \aleph_2$. No previous knowledge of subversion forcing or nice iterations will be assumed. This is joint work with Gunter Fuchs.

We will study infinite two player games and the large cardinal strength corresponding to their determinacy. For games of length $\omega$ this is well understood and there is a tight connection between the determinacy of projective games and the existence of canonical inner models with Woodin cardinals. For games of arbitrary countable length, Itay Neeman proved the determinacy of analytic games of length $\omega \cdot \theta$ for countable $\theta\> \omega$ from a sharp for $\theta$ Woodin cardinals. We aim for a converse at successor ordinals and sketch how to obtain $\omega+n$ Woodin cardinals from the determinacy of $\boldsymbol\Pi^1_{n+1}$ games of length $\omega^2$. Moreover, we outline how to generalize this to construct a model with $\omega+\omega$ Woodin cardinals from the determinacy games of length $\omega^2$ with $\Game^{\mathbb{R}}\boldsymbol\Pi^1_1$ payoff.
This is joint work with Juan P. Aguilera.

I will give an overview over the theory of bounded forcing axioms, and explore some that are compatible with the continuum hypothesis. One of these is an axiom I propose to call the bounded forcing axiom for countably closed forcing (which at first may sound like an absurd concept, since already $MA_{\omega_1}$ for countably closed forcing is a theorem of ZFC). I will then focus on the bounded forcing axiom for subcomplete forcing (BSCFA), and show a result that was obtained in joined work with Kaethe Minden, that in the presence of CH, this axiom is equivalent to the absoluteness of the set of branches of any tree of height and width $\omega_1$. Time permitting, I may also mention some 'predicative' strengthenings of bounded forcing axioms whose versions for subcomplete forcing allow us to conclude the existence of a definable well-order of the power set of $\omega_1$, assuming the mantle is a ground.