The Mouse Set Theorem Just Past Projective

Abstract

We identify a particular mouse, Mld, the minimal ladder mouse, that sits in the mouse order just past Mn for all n, and we show that R Mld = Qω+1, the set of reals that are 1ω+1 in a countable ordinal. Thus Qω+1 is a mouse set. This is analogous to the fact that R M1 = Q3 where M1 is the the sharp for the minimal inner model with a Woodin cardinal, and Q3 is the set of reals that are 13 in a countable ordinal. More generally R M2n+1 = Q2n+3. The mouse Mld and the set Qω+1 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. R Mld ⊂eq Qω+1 was known in the 1990's. But Qω+1 ⊂eq Mld was open until Woodin found a proof in 2018. The main goal of this paper is to give Woodin's proof.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…