We show that the Axiom of Dependent Choice,, holds in countably iterable, passive premice constructed over their reals which satisfy the Axiom of Determinacy,, in a background universe. This generalizes an argument of Kechris for using Steel's analysis of scales in mice. In particular, we show that for any and any countable set of reals A so that and, we have that.

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)

We show from an abstract comparison principle that the Mitchell order is linear on sufficiently strong ultrafilters: normal ultrafilters, Dodd solid ultrafilters, and assuming GCH, generalized normal ultrafilters. This gives a conditional answer to the well-known question of whether a [Formula: see text]-supercompact cardinal [Formula: see text] must carry more than one normal measure of order 0. Conditioned on a very plausible iteration hypothesis, the answer is no, since the Ultrapower Axiom holds in the canonical inner models at the finite (...) levels of supercompactness. (shrink)

We give a fairly complete account which first shows that the solution to the inner model problem for one supercompact cardinal will yield an ultimate version ofLand then shows that the various current approaches to inner model theory must be fundamentally altered to provide that solution.

We introduce 0• as a sharp for an inner model with a proper class of strong cardinals. We prove the existence of the core model K in the theory “ does not exist”. Combined with work of Woodin, Steel, and earlier work of the author, this provides the last step for determining the exact consistency strength of the assumption in the statement of the 12th Delfino problem pp. 221–224)).

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.

I develop a translation procedure between λ-structures, which correspond to premice in the Friedman–Jensen indexing convention on the one hand and s-structures, which are essentially the same as premice in the Mitchell–Steel indexing scheme.

Assume that there is no transitive class model of [Formula: see text] with a Woodin cardinal. Let [Formula: see text] be a singular ordinal such that [Formula: see text] and [Formula: see text]. Suppose [Formula: see text] is a regular cardinal in K. Then [Formula: see text] is a measurable cardinal in K. Moreover, if [Formula: see text], then [Formula: see text].

We present a general construction of a □κ-sequence in Jensen's fine structural extender models. This construction yields a local definition of a canonical □κ-sequence as well as a characterization of those cardinals κ, for which the principle □κ fails. Such cardinals are called subcompact and can be described in terms of elementary embeddings. Our construction is carried out abstractly, making use only of a few fine structural properties of levels of the model, such as solidity and condensation.

We prove a number of results on the determinacy of σ-projective sets of reals, i.e., those belonging to the smallest pointclass containing the open sets and closed under complements, countable unions, and projections. We first prove the equivalence between σ-projective determinacy and the determinacy of certain classes of games of variable length <ω^2 (Theorem 2.4). We then give an elementary proof of the determinacy of σ-projective sets from optimal large-cardinal hypotheses (Theorem 4.4). Finally, we show how to generalize the proof (...) to obtain proofs of the determinacy of σ-projective games of a given countable length and of games with payoff in the smallest σ-algebra containing the projective sets, from corresponding assumptions (Theorem 5.1, Theorem 5.4). (shrink)

Continuing the work of Fuchs [1], I show that the translation functions developed previously map iterable λ-structures to iterable s-structures and vice versa. To this end, I analyse how the translation functions interact with the formation of extender ultrapowers and normal iterations. This analysis makes it possible to translate iterations, and, in a last step, iteration strategies, thus arriving at the result.

We study generalizations of Dodd parameters and establish their fine structural properties in Jensen extender models with λ-indexing. These properties are one of the key tools in various combinatorial constructions, such as constructions of square sequences and morasses.

We prove that if image is a Jensen extender model, then image satisfies the Gap-1 morass principle. As a corollary to this and a theorem of Jensen, the model image satisfies the Gap-2 Cardinal Transfer Property → for all infinite cardinals κ and λ.