Iterability for (transfinite) stacks
From MaRDI portal
Publication:5156473
DOI10.1142/S0219061321500082OpenAlexW3082247464MaRDI QIDQ5156473FDOQ5156473
Authors: Farmer Schlutzenberg 
Publication date: 18 October 2021
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.03880
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
condensationnormalizationstackinner modellarge cardinalmouseiteration strategyiterabilityiteration tree
Large cardinals (03E55) Inner models, including constructibility, ordinal definability, and core models (03E45)
Cites Work
- An outline of inner model theory
- Inner models and large cardinals
- Title not available (Why is that?)
- Combinatorial principles in the core model for one Woodin cardinal
- Homogeneously Suslin sets in tame mice
- Title not available (Why is that?)
- Hod mice and the mouse set conjecture
- The self-iterability of L[E]
- Core models with more Woodin cardinals
- Fine structure for tame inner models
- VARSOVIAN MODELS I
- A weak Dodd-Jensen lemma
- A long pseudo-comparison of premice in \(L[x]\)
- A premouse inheriting strong cardinals from \(V\)
Cited In (5)
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)
