The definability of \(\mathbb{E}\) in self-iterable mice
From MaRDI portal
Publication:2105098
DOI10.1016/j.apal.2022.103208OpenAlexW4307483527MaRDI QIDQ2105098
Publication date: 8 December 2022
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.0085
Inner models, including constructibility, ordinal definability, and core models (03E45) Large cardinals (03E55) Applications of set theory (03E75) Set theory (03E99)
Cites Work
- Unnamed Item
- Unnamed Item
- The covering lemma up to a Woodin cardinal
- A long pseudo-comparison of premice in \(L[x\)]
- Projectively well-ordered inner models
- Combinatorial principles in the core model for one Woodin cardinal
- Reinhardt cardinals and iterates of \(V\)
- Hod mice and the Mouse Set Conjecture
- Sets constructed from sequences of measures: Revisited
- An Outline of Inner Model Theory
- Deconstructing inner model theory
- The self-iterability of L[E]
- Core models in the presence of Woodin cardinals
- Sets constructible from sequences of ultrafilters
- The maximality of the core model
- Core models with more Woodin cardinals
- Fine structure for tame inner models
- Homogeneously Suslin sets in tame mice
- Iterability for (transfinite) stacks
- Some applications of iterated ultrapowers in set theory
- Inner models and large cardinals
This page was built for publication: The definability of \(\mathbb{E}\) in self-iterable mice
