New methods in forcing iteration and applications
The Theme. Strong forcing axioms like Martin’s Maximum give a reasonably satisfactory structural analysis of $H(\omega _2)$ . A broad program in modern Set Theory is searching for strong forcing axioms beyond $\omega _1$ . In other words, one would like to figure out the structural properties of tal...
Gespeichert in:
Veröffentlicht in: | The bulletin of symbolic logic 2023-06, Vol.29 (2), p.300-302 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The Theme. Strong forcing axioms like Martin’s Maximum give a reasonably satisfactory structural analysis of
$H(\omega _2)$
. A broad program in modern Set Theory is searching for strong forcing axioms beyond
$\omega _1$
. In other words, one would like to figure out the structural properties of taller initial segments of the universe. However, the classical techniques of forcing iterations seem unable to bypass the obstacles, as the resulting forcings axioms beyond
$\omega _1$
have not thus far been strong enough! However, with his celebrated work on generalised side conditions, I. Neeman introduced us to a novel paradigm to iterate forcings. In particular, he could, among other things, reprove the consistency of the Proper Forcing Axiom using an iterated forcing with finite supports. In 2015, using his technology of virtual models, Veličković built up an iteration of semi-proper forcings with finite supports, hence reproving the consistency of Martin’s Maximum, an achievement leading to the notion of a virtual model. In this thesis, we are interested in constructing forcing notions with finitely many virtual models as side conditions to preserve three uncountable cardinals. The thesis constitutes six chapters and three appendices that amount to 118 pages, where Section 1 is devoted to preliminaries, and Section 2 is a warm-up about the scaffolding poset of a proper forcing. In Section 3, we present the general theory of virtual models in the context of forcing with sets of models of two types, where we, e.g., define the “meet” between two virtual models and prove its properties. The main results are joint with Boban Veličković, and partly appeared in Guessing models and the approachability ideal, J. Math. Log. 21 (2021). Pure Side Conditions. In Section 4, we use two types of virtual models (countable and large non-transitive ones induced by a supercompact cardinal, which we call Magidor models) to construct our forcing with pure side conditions. The forcing covertly uses a third type of models that are transitive. We also add decorations to the conditions to add many clubs in the generic
$\omega _2$
. In contrast to Neeman’s method, we do not have a single chain, but
$\alpha $
-chains, for an ordinal
$\alpha $
with
$V_\alpha \prec V_\lambda $
. Thus, starting from suitable large cardinals
$\kappa |
---|---|
ISSN: | 1079-8986 1943-5894 |
DOI: | 10.1017/bsl.2023.7 |