English

Reconstructing resurrection

Logic 2018-11-13 v1

Abstract

Let RR be an iterable weak coarse premouse and let NN be a premouse with Mitchell-Steel indexing, produced by a fully backgrounded L[E]L[\mathbb{E}]-construction of RR. We identify and correct a problem with the process of resurrection used in the proof of iterability of NN.

Cite

@article{arxiv.1811.04236,
  title  = {Reconstructing resurrection},
  author = {Farmer Schlutzenberg},
  journal= {arXiv preprint arXiv:1811.04236},
  year   = {2018}
}

Comments

11 pages

R2 v1 2026-06-23T05:11:20.732Z