Comparison of fine structural mice via coarse iteration

DOI10.1007/S00153-014-0379-6MaRDI QIDQ403403zbMATHOpenAlexFDO

Authors John Steel, Farmer Schlutzenberg

Publication date 29 August 2014

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.6363

zbMATH Keywords

comparisoninner modelbackground construction

Mathematics Subject Classification ID

Large cardinals (03E55) Inner models, including constructibility, ordinal definability, and core models (03E45)

Abstract: 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 this process succeeds.

Recommendations

• scientific article; zbMATH DE number 567513
• Distinct iterable branches
• Iteration Trees
• A criterion for coarse iterability
• A long pseudo-comparison of premice in \(L[x]\)

Cites work

• scientific article; zbMATH DE number 5504385 (Why is no real title available?)
• scientific article; zbMATH DE number 567513 (Why is no real title available?)
• An outline of inner model theory
• Homogeneously Suslin sets in tame mice
• Iteration Trees

Cited in

(5)

• A weak Dodd-Jensen lemma
• Fine structure for tame inner models
• VARSOVIAN MODELS I
• A criterion for coarse iterability
• NEGATIVE RESULTS ON PRECIPITOUS IDEALS ON

This page was built for publication: Comparison of fine structural mice via coarse iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403403)