The Mouse Set Theorem Just Past Projective
Logic
2023-10-24 v2
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 1990's. But was open until Woodin found a proof in 2018. The main goal of this paper is to give Woodin's proof.
Cite
@article{arxiv.2302.02581,
title = {The Mouse Set Theorem Just Past Projective},
author = {Mitch Rudominer},
journal= {arXiv preprint arXiv:2302.02581},
year = {2023}
}
Comments
30 pages