Related papers: Background construction for $\lambda$-indexed mice

We show that (i) the standard fine structural properties for premice follow from normal iterability (whereas the classical proof relies on iterability for stacks of normal trees), and (ii) every mouse which is finitely generated above its…

Let M be a fine structural mouse. Let D be a fully backgrounded L[E]-construction computed inside an iterable coarse premouse S. We describe a process comparing M with D, through forming iteration trees on M and on S. We then prove that…

We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let $\Omega$ be a regular uncountable cardinal. Let $m<\omega$ and $M$ be an $m$-sound premouse and $\Sigma$ be an…

Let $R$ be an iterable weak coarse premouse and let $N$ be a premouse with Mitchell-Steel indexing, produced by a fully backgrounded $L[\mathbb{E}]$-construction of $R$. We identify and correct a problem with the process of resurrection…

We identify a premouse inner model $L[\mathbb{E}]$, such that for any coarsely iterable background universe $R$ modelling $\mathrm{ZFC}$, $L[\mathbb{E}]^R$ is a proper class premouse of $R$ inheriting all strong and Woodin cardinals from…

Let $M$ be a fine structural mouse and let $F\in M$ be such that $M\models$``$F$ is a total extender'' and $(M||\mathrm{lh}(F),F)$ is a premouse. We show that it follows that $F\in\mathbb{E}^M$, where $\mathbb{E}^M$ is the extender sequence…

Suppose there is a Reinhardt cardinal. Then (1) $M_n(X)$ exists and is fully iterable (above $X$) for every transitive set $X$ and every $n<\omega$ (here $M_n(X)$ denotes the canonical minimal proper class inner model containing $X$ and…

We develop the theory of meta-iteration trees, that is, iteration trees whose base "model" is itself an ordinary iteration tree. We prove a comparison theorem for meta-iteration strategies parallel to the one for ordinary iteration…

We investigate Steel's conjecture in 'The Core Model Iterability Problem', that if $W$ and $R$ are $\Omega+1$-iterable, $1$-small weasels, then $W\leq^{*}R$ iff there is a club $C\subset\Omega$ such that for all $\alpha\in C$, if $\alpha$…

We develop the fine structure theory of operator-premice. These are a generalization of standard premice, in which an abstract operator $F$ is used to form the successor steps in the internal hierarchy of the premouse, instead of Jensen's…

It is shown that if there is a measurable cardinal above n Woodin cardinals and M_{n+1}^# doesn't exist then K exists. K is not fully iterable, though, but only iterable with respect to stacks of certain trees living between the Woodin…

We describe the extension of normal iteration strategies with appropriate condensation properties to strategies for stacks of normal trees, with full normalization. Given a regular uncountable cardinal $\Omega$ and an…

This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings…

Let $R$ be the class of regular cardinals which are not hyperinaccessible. We show that $L[R]$, and similar inner models in the $\alpha$-inaccessible hierarchy, can be generated by iterating a small "machete" mouse up through all the…

We describe an obstacle to the analysis of $\mathrm{HOD}^{L[x]}$ as a core model: Assuming sufficient large cardinals, for a Turing cone of reals $x$ there are premice $M,N$ in $\mathrm{HC}^{L[x]}$ such that the pseudo-comparison of $L[M]$…

Assume ZF + AD + $V=L(\mathbb{R})$. We prove some "mouse set" theorems, for definability over $J_\alpha(\mathbb{R})$ where $[\alpha,\alpha]$ is a projective-like gap (of $L(\mathbb{R})$) and $\alpha$ is either a successor ordinal or has…

We give a construction of scales (in the descriptive set theoretic sense) directly from mouse existence hypotheses, without using any determinacy arguments. The construction is related to the Martin-Solovay construction for scales on…

We introduce a mean-field model of lattice trees based on embeddings into $\Z^d$ of abstract trees having a critical Poisson offspring distribution. This model provides a combinatorial interpretation for the self-consistent mean-field model…

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…

We investigate the problem of when $\leq\lambda$--support iterations of $<\lambda$--complete notions of forcing preserve $\lambda^+$. We isolate a property -- {\em properness over diamonds} -- that implies $\lambda^+$ is preserved and show…