In this paper we explore a connection between descriptive set theory and inner model theory. From descriptive set theory, we will take a countable, definable set of reals, A. We will then show that , where is a canonical model from inner model theory. In technical terms, is a “mouse”. Consequently, we say that A is a mouse set. For a concrete example of the type of set A we are working with, let ODnω1 be the set of reals which (...) are ∑n definable over the model Lω1 , from an ordinal parameter. In this paper we will show that for all n 1, ODnω1 is a mouse set. Our work extends some similar results due to D.A. Martin, J.R. Steel, and H. Woodin. Several interesting questions in this area remain open. (shrink)

Let κ R be the least ordinal κ such that L κ (R) is admissible. Let $A = \{x \in \mathbb{R} \mid (\exists\alpha such that x is ordinal definable in L α (R)}. It is well known that (assuming determinacy) A is the largest countable inductive set of reals. Let T be the theory: ZFC - Replacement + "There exists ω Woodin cardinals which are cofinal in the ordinals." T has consistency strength weaker than that of the theory ZFC + (...) "There exists ω Woodin cardinals", but stronger than that of the theory ZFC + "There exists n Woodin Cardinals", for each n ∈ ω. Let M be the canonical, minimal inner model for the theory T. In this paper we show that A = R ∩ M. Since M is a mouse, we say that A is a mouse set. As an application, we use our characterization of A to give an inner-model-theoretic proof of a theorem of Martin which states that for all n, every Σ * n real is in A. (shrink)

We identify a particular mouse, [Formula: see text], the minimal ladder mouse, that sits in the mouse order just past [Formula: see text] for all [Formula: see text], and we show that [Formula: see text], the set of reals that are [Formula: see text] in a countable ordinal. Thus [Formula: see text] is a mouse set. This is analogous to the fact that [Formula: see text] where [Formula: see text] is the sharp for the minimal inner model with a Woodin (...) cardinal, and [Formula: see text] is the set of reals that are [Formula: see text] in a countable ordinal. More generally [Formula: see text]. The mouse [Formula: see text] and the set [Formula: see text] 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. [Formula: see text] was known in the 1990s. But [Formula: see text] was open until Woodin found a proof in 2018. The main goal of this paper is to give Woodin’s proof. (shrink)

An inner model operator is a function M such that given a Turing degree d, M is a countable set of reals, d M, and M has certain closure properties. The notion was introduced by Steel. In the context of AD, we study inner model operators M such that for a.e. d, there is a wellorder of M in L). This is related to the study of mice which are below the minimal inner model with ω Woodin cardinals. As a (...) technical tool, we show that the alternative fine structure theory developed by Mitchell and Steel for mice with Woodin cardinals is equivalent to the traditional fine structure theory developed by Jensen for L. (shrink)