Reconstructing resurrection
classification
🧮 math.LO
keywords
premouseresurrectionbackgroundedcoarseconstructioncorrectfullyidentify
read the original 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[\mathbb{E}]$-construction of $R$. We identify and correct a problem with the process of resurrection used in the proof of iterability of $N$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.