Let 0 < n < ω. If there are n Woodin cardinals and a measurable cardinal above, but $M_{n+1}^{\#}$ doesn't exist, then the core model K exists in a sense made precise. An Iterability Inheritance Hypothesis is isolated which is shown to imply an optimal correctness result for K.

We extend the core model induction technique to a choiceless context, and we exploit it to show that each one of the following two hypotheses individually implies that , the Axiom of Determinacy, holds in the of a generic extension of : every uncountable cardinal is singular, and every infinite successor cardinal is weakly compact and every uncountable limit cardinal is singular.

Let Mn♯ denote the minimal active iterable extender model which has n Woodin cardinals and contains all reals, if it exists, in which case we denote by Mn the class-sized model obtained by iterating the topmost measure of Mn class-many times. We characterize the sets of reals which are Σ1-definable from R over Mn, under the assumption that projective games on reals are determined:1. for even n, Σ1Mn=⅁RΠn+11;2. for odd n, Σ1Mn=⅁RΣn+11.This generalizes a theorem of Martin and Steel for L, (...) that is, the case n=0. As consequences of the proof, we see that determinacy of all projective games with moves in R is equivalent to the statement that Mn♯ exists for all n∈N, and that determinacy of all projective games of length ω2 with moves in N is equivalent to the statement that Mn♯ exists and satisfies AD for all n∈N. (shrink)

We prove the following result which is due to the third author. Let [Formula: see text]. If [Formula: see text] determinacy and [Formula: see text] determinacy both hold true and there is no [Formula: see text]-definable [Formula: see text]-sequence of pairwise distinct reals, then [Formula: see text] exists and is [Formula: see text]-iterable. The proof yields that [Formula: see text] determinacy implies that [Formula: see text] exists and is [Formula: see text]-iterable for all reals [Formula: see text]. A consequence is (...) the Determinacy Transfer Theorem for arbitrary [Formula: see text], namely the statement that [Formula: see text] determinacy implies [Formula: see text] determinacy. (shrink)

If the Bounded Proper Forcing Axiom BPFA holds, then Mouse Reflection holds at N₂ with respect to all mouse operators up to the level of Woodin cardinals in the next ZFC-model. This yields that if Woodin's ℙ max axiom (*) holds, then BPFA implies that V is closed under the "Woodin-in-the-next-ZFC-model" operator. We also discuss stronger Mouse Reflection principles which we show to follow from strengthenings of BPFA, and we discuss the theory BPFA plus "NS ω1 is precipitous" and strengthenings (...) thereof. Along the way, we answer a question of Baumgartner and Taylor. [2, Question 6.11]. (shrink)

If ω n has the tree property for all $2 \leq n and $2^{ , then for all X ∈ H ℵ ω and $n exists.

We show that under the assumption of the existence of the canonical inner model with one Woodin cardinal$M_1$, there is a model of$\mathsf {ZFC}$in which$\mbox {NS}_{\omega _{1}}$is$\aleph _2$-saturated and${\Delta }_{1}$-definable with$\omega _1$as a parameter which answers a question of S. D. Friedman and L. Wu. We also show that starting from an arbitrary universe with a Woodin cardinal, there is a model with$\mbox {NS}_{\omega _{1}}$saturated and${\Delta }_{1}$-definable with a ladder system$\vec {C}$and a full Suslin treeTas parameters. Both results rely on (...) a new coding technique whose presentation is the main goal of this article. (shrink)

We describe the inner models with representatives in all equivalence classes of thin equivalence relations in a given projective pointclass of even level assuming projective determinacy. The main result shows that these models are characterized by their correctness and the property that they correctly compute the tree from the appropriate scale. The main step towards this characterization shows that the tree from a scale can be reconstructed in a generic extension of an iterate of a mouse. We then construct models (...) with this property as generic extensions of iterates of mice under the assumption that the corresponding projective ordinal is below ω2ω2. On the way, we consider several related problems, including the question when forcing does not add equivalence classes to thin projective equivalence relations. For instance, we show that if every set has a sharp, then reasonable forcing does not add equivalence classes to thin provably View the MathML source Δ1/3 equivalence relations, and generalize this to all projective levels. (shrink)

The purpose of this paper is to outline some recent progress in descriptive inner model theory, a branch of set theory which studies descriptive set theoretic and inner model theoretic objects using tools from both areas. There are several interlaced problems that lie on the border of these two areas of set theory, but one that has been rather central for almost two decades is the conjecture known as the Mouse Set Conjecture. One particular motivation for resolving MSC is that (...) it provides grounds for solving the inner model problem which dates back to 1960s. There have been some new partial results on MSC and the methods used to prove the new instances suggest a general program for solving the full conjecture. It is then our goal to communicate the ideas of this program to the community at large. (shrink)

Let n ≥ 3 be an integer. We show that it is consistent (relative to the consistency of n - 2 strong cardinals) that every $\Sigma_n^1-set$ of reals is universally Baire yet there is a (lightface) projective well-ordering of the reals. The proof uses "David's trick" in the presence of inner models with strong cardinals.

Let n ≥ 3 be an integer. We show that it is consistent that every σ1n-set of reals is universally Baire yet there is a projective well-ordering of the reals. The proof uses “David’s trick” in the presence of inner models with strong cardinals.

This paper studies homogeneously Suslin (hom) sets of reals in tame mice. The following results are established: In 0 ¶ the hom sets are precisely the [Symbol] sets. In M n every hom set is correctly [Symbol] and (δ + 1)-universally Baire where ä is the least Woodin. In M u every hom set is <λ-hom, where λ is the supremum of the Woodins.

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)

For a canonical model of set theory whose projective theory of the real numbers is stable under set forcing extensions, a set of reals of minimal complexity is constructed which fails to be universally Baire. The construction uses a general method for generating non-universally Baire sets via the Levy collapse of a cardinal, as well as core model techniques. Along the way it is shown (extending previous results of Steel) how sufficiently iterable fine structure models recognize themselves as global core (...) models. (shrink)

The use of Extended Logics to replace ordinary second order definability in Kleene’s Ramified Analytical Hierarchy is investigated. This mirrors a similar investigation of Kennedy, Magidor and Väänänen [11] where Gödel’s universe L of constructible sets is subjected to similar variance. Enhancing second order definability allows models to be defined which may or may not coincide with the original Kleene hierarchy in domain. Extending the logic with game quantifiers, and assuming strong axioms of infinity, we obtain minimal correct models of (...) analysis. A wide spectrum of models can be so generated from abstract definability notions: one may take an abstract Spector Class and extract an extended logic for it. The resultant structure is then a minimal model of the given kind of definability. (shrink)

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)