The definability of E in self-iterable mice
From MaRDI portal
Publication:2105098
Recommendations
- The definability of E(α)
- Iterated definability, lawless sequences, and Brouwer's continuum
- Definability in the Recursively Enumerable Degrees
- A long and winding road to definable sets
- scientific article; zbMATH DE number 1984520
- \(\lambda\)-definability and recursiveness
- The mouse set conjecture for sets of reals
- Definable sets of real numbers, infinite games and core model theory
- Definable continuous mappings and Whyburn’s conjecture
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
Cites work
- scientific article; zbMATH DE number 567513 (Why is no real title available?)
- scientific article; zbMATH DE number 967740 (Why is no real title available?)
- A long pseudo-comparison of premice in \(L[x]\)
- An outline of inner model theory
- Combinatorial principles in the core model for one Woodin cardinal
- Core models in the presence of Woodin cardinals
- Core models with more Woodin cardinals
- Deconstructing inner model theory
- Fine structure for tame inner models
- Hod mice and the mouse set conjecture
- Homogeneously Suslin sets in tame mice
- Inner models and large cardinals
- Iterability for (transfinite) stacks
- Projectively well-ordered inner models
- Reinhardt cardinals and iterates of \(V\)
- Sets constructed from sequences of measures: Revisited
- Sets constructible from sequences of ultrafilters
- Some applications of iterated ultrapowers in set theory
- The covering lemma up to a Woodin cardinal
- The maximality of the core model
- The self-iterability of L[E]
Cited in
(3)
This page was built for publication: The definability of \(\mathbb{E}\) in self-iterable mice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105098)