Comparison of fine structural mice via coarse iteration

DOI10.1007/S00153-014-0379-6zbMATH Open1353.03061arXiv1309.6363OpenAlexW1976140694MaRDI QIDQ403403FDOQ403403

Farmer Schlutzenberg, John Steel

Publication date: 29 August 2014

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An Outline of Inner Model Theory
• Iteration Trees
• Homogeneously Suslin sets in tame mice

Cited In (4)

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

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)