The Mouse Set Theorem Just Past Projective
Mitch Rudominer

TL;DR
This paper proves that the minimal ladder mouse $M^{ld}$ contains exactly the reals that are $oldsymbol{ riangle^1_{oldsymbol{oldsymbol{ ext{omega+1}}}}}$, establishing a key connection between mice and projective sets just past the projective hierarchy.
Contribution
The paper provides a detailed proof that the set of reals in $M^{ld}$ equals $Q_{\omega+1}$, confirming the mouse set theorem just past the projective hierarchy.
Findings
$\mathbb{R} \cap M^{ld} = Q_{\omega+1}$ established
Confirmed the inclusion $Q_{\omega+1} \subseteq M^{ld}$
Connected the minimal ladder mouse to the projective hierarchy
Abstract
We identify a particular mouse, , the minimal ladder mouse, that sits in the mouse order just past for all , and we show that , the set of reals that are in a countable ordinal. Thus is a mouse set. This is analogous to the fact that where is the the sharp for the minimal inner model with a Woodin cardinal, and is the set of reals that are in a countable ordinal. More generally . The mouse and the set compose the next natural pair to consider in this series of results. Thus we are proving the mouse set theorem just past projective. Some of this is not new. was known in the…
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 · Mathematical and Theoretical Analysis
