Iteration Trees

From MaRDI portal
Revision as of 19:00, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4276535


DOI10.2307/2152720zbMath0808.03035MaRDI QIDQ4276535

Donald A. Martin, J. R. Steel

Publication date: 15 March 1995

Full work available at URL: https://doi.org/10.2307/2152720


03E15: Descriptive set theory

03E55: Large cardinals

03E60: Determinacy principles


Related Items

Strong Cardinals and Sets of Reals in Lω1(ℝ), Woodin cardinals, Shelah cardinals, and the Mitchell-Steel core model, Mice with finitely many Woodin cardinals from optimal determinacy hypotheses, SEALING OF THE UNIVERSALLY BAIRE SETS, On the derived models of self-iterable universes, THE CONSISTENCY STRENGTH OF LONG PROJECTIVE DETERMINACY, IN SEARCH OF ULTIMATE-LTHE 19TH MIDRASHA MATHEMATICAE LECTURES, Woodin’s axiom (*), or Martin’s Maximum, or both?, The domestic levels of \(K^c\) are iterable, How to win some simple iteration games, Strong cardinals in the core model, Equiconsistencies at subcompact cardinals, The weak ultrafilter axiom, 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 from iterability, The Continuum Hypothesis, On -Strongly Measurable Cardinals, Comparison of fine structural mice via coarse iteration, The covering lemma up to a Woodin cardinal, Large cardinals and iteration trees of height \(\omega\), Inner models with many Woodin cardinals, Coherent sequences versus Radin sequences, Large cardinal axioms and independence: The continuum problem revisited, Mouse sets, Inner models in the region of a Woodin limit of Woodin cardinals, \(L(\mathbb{R}, \mu)\) is unique, Recognizable sets and Woodin cardinals: computation beyond the constructible universe, Projectively well-ordered inner models, Combinatorial principles in the core model for one Woodin cardinal, The consistency strength of projective absoluteness, \(\Pi_ 2^ 1\) Wadge degrees, Tall cardinals in extender models, Thin equivalence relations and inner models, Boolean-valued second-order logic, Hod mice and the Mouse Set Conjecture, Tame failures of the unique branch hypothesis and models of ADℝ + Θ is regular, A Proof of Projective Determinacy, The maximality of the core model



Cites Work