Recommendations
- Transfinite recursion and computation in the iterative conception of set
- scientific article; zbMATH DE number 6876328
- Hyperations, Veblen progressions and transfinite iteration of ordinal functions
- Bases for parametrized iterativity
- Layer-by-layer infinite iterations of some metrizable functors
- Countable spectrum, transfinite induction and stability
- The iterability hierarchy above \(\mathsf {I3}\)
- Transfinite corecursion
- Finiteness theorems for the Picard objects of an algebraic stack
- scientific article; zbMATH DE number 2169107
Cites work
- A long pseudo-comparison of premice in \(L[x]\)
- A premouse inheriting strong cardinals from \(V\)
- A weak Dodd-Jensen lemma
- An outline of inner model theory
- Combinatorial principles in the core model for one Woodin cardinal
- Core models with more Woodin cardinals
- Fine structure for tame inner models
- Hod mice and the mouse set conjecture
- Homogeneously Suslin sets in tame mice
- scientific article; zbMATH DE number 567513 (Why is no real title available?)
- scientific article; zbMATH DE number 967740 (Why is no real title available?)
- Inner models and large cardinals
- The self-iterability of L[E]
- VARSOVIAN MODELS I
Cited in
(9)- Bases for parametrized iterativity
- The definability of \(\mathbb{E}\) in self-iterable mice
- π²πΎπΊπ πππ from iterability
- The comparison lemma
- Ideals and strong axioms of determinacy
- On a conjecture regarding the mouse order for weasels
- Analysis of HOD for admissible structures
- Ordinal definability in \(L[\mathbb{E}]\)
- Low level definability above large cardinals
This page was built for publication: Iterability for (transfinite) stacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5156473)
