English
Related papers

Related papers: Fine structure from normal iterability

200 papers

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…

Logic · Mathematics 2014-11-27 Farmer Schlutzenberg , John R. Steel

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…

Logic · Mathematics 2025-04-11 Farmer Schlutzenberg

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…

Logic · Mathematics 2019-03-20 Farmer Schlutzenberg

Let $M$ be a $\lambda$-indexed (that is, Jensen indexed) premouse. We prove that $M$ is iterable with respect to standard $\lambda$-iteration rules iff $M$ is iterable with respect to a natural version of Mitchell-Steel iteration rules.…

Logic · Mathematics 2021-01-12 Farmer Schlutzenberg

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…

Logic · Mathematics 2020-04-28 Farmer Schlutzenberg

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…

Logic · Mathematics 2022-07-25 Benjamin Siskind , John Steel

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$…

Logic · Mathematics 2025-04-16 Jan Kruschewski , Farmer Schlutzenberg

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…

Logic · Mathematics 2024-03-19 Farmer Schlutzenberg

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…

Logic · Mathematics 2024-06-11 Farmer Schlutzenberg

Let $M$ be a tame mouse modelling ZFC. We show that $M$ satisfies "$V=\mathrm{HOD}_x$ for some real $x$", and that the restriction $\mathbb{E}\upharpoonright[\omega_1^M,\mathrm{OR}^M)$ of the extender sequence $\mathbb{E}^M$ of $M$ to…

Logic · Mathematics 2026-04-15 Farmer Schlutzenberg

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…

Logic · Mathematics 2024-02-07 Farmer Schlutzenberg

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,…

Logic · Mathematics 2025-04-16 Gunter Fuchs , Corey Bacal Switzer

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…

Logic · Mathematics 2016-09-06 William Mitchell

This article is Part I in a series of three papers devoted to determining the minimal complexity of scales in the inner model $K(\mathbb{R})$. Here, in Part I, we shall complete our development of a fine structure theory for $K(\mathbb{R})$…

Logic · Mathematics 2007-05-23 D. W. Cunningham

We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…

Group Theory · Mathematics 2024-12-18 Martin R. Bridson

We extend the normalization results of the author's paper "Full normalization for transfinite stacks" [5] to mice at the level of $\kappa^+$-supercompactness: given a normal iteration strategy $\Sigma$ for such a mouse $M$, with both $M$…

Logic · Mathematics 2025-06-11 Farmer Schlutzenberg

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

Logic · Mathematics 2016-09-07 Ernest Schimmerling , John R. Steel

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

Logic · Mathematics 2021-06-21 Ali Enayat

In this note, we generalize a characterization of the Clifford torus due to Ros. Let $f:M\rightarrow S^{n+1}$ be an embedded closed minimal hypersurface. Assume there are $(n+2)$ great hyperspheres of $S^{n+1}$ perpendicular to each other,…

Differential Geometry · Mathematics 2020-11-02 Changping Wang , Peng Wang

We obtain sealing by forcing over a self-iterable model. The proof is fine-structure free and uses only basic ideas from iteration theory. We believe that such fine-structure free proofs will make the subject more accessible to the general…

Logic · Mathematics 2021-10-14 Grigor Sargsyan , Nam Trang
‹ Prev 1 2 3 10 Next ›