More Derived Models in PFA
Derek Levinson, Nam Trang, Trevor Wilson

TL;DR
This paper advances understanding of the derived model at Woodin cardinals, showing under certain axioms and conditions that the model satisfies determinacy hypotheses and analyzing the size of the model's $ heta$ using Covering Matrices.
Contribution
It introduces Covering Matrices to analyze the derived model at Woodin cardinals and establishes conditions under which the model satisfies $AD_{\mathbb{R}}$ and bounds on $ heta$.
Findings
The $ heta$ of the derived model is less than $oldsymbol{ ext{cardinal}}^+$ under various circumstances.
Under $PFA$, the derived model satisfies $AD_{\mathbb{R}}$ when $oldsymbol{ ext{limit of Woodin cardinals}}$ has cofinality $oldsymbol{ ext{omega}}$.
If $oldsymbol{ ext{indestructibly weakly compact limit of Woodin cardinals}}$, then the derived model satisfies $AD_{\mathbb{R}}$.
Abstract
This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like and the derived model at a limit of Woodin cardinals . In particular, using a concept called Covering Matrices, we show that the of the derived model at is strictly less than under various circumstances; in particular, this shows that the conclusion holds under if is a limit of Woodin cardinals of cofinality and the derived model does not satisfy . Assuming a form of mouse capturing, we show that the derived model satisfies under when is a regular limit of Woodin cardinals. If is an indestructibly -weakly compact limit of Woodin cardinals, then the derived model outright satisfies .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Advanced Banach Space Theory
