Reconstructing resurrection
Abstract
Let R be an iterable weak coarse premouse and let N be a premouse with Mitchell-Steel indexing, produced by a fully backgrounded L[E]-construction of R. We identify and correct a problem with the process of resurrection used in the proof of iterability of N.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.