The mouse set theorem just past projective
- 13 March 2024
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
- Vol. 25 (02)
Abstract
We identify a particular mouse, [ ], the minimal ladder mouse, that sits in the mouse order just past [ ] for all n, 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 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 1990s. But [ ] was open until Woodin found a proof in 2018. The main goal of this paper is to give Woodin’s proof.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Thin equivalence relations and inner modelsAnnals of Pure and Applied Logic, 2014
- Determinacy in L(ℝ)2009
- An Outline of Inner Model Theory2009
- Introduction to Q-Theory2006
- Some applications of coarse inner model theoryThe Journal of Symbolic Logic, 1997
- Large cardinals and definable counterexamples to the continuum hypothesisAnnals of Pure and Applied Logic, 1995
- Projectively well-ordered inner modelsAnnals of Pure and Applied Logic, 1995
- Fine Structure and Iteration Trees1994
- Inner models with many Woodin cardinalsAnnals of Pure and Applied Logic, 1993
- On the determinacy of games on ordinalsAnnals of Mathematical Logic, 1981