Taking Reinhardt's Power Away
Logic
2021-02-05 v3
Abstract
We study the notion of non-trivial elementary embeddings under the assumption that satisfies without Power Set but with the Collection Scheme. We show that no such embedding can exist under the additional assumption that it is cofinal and either is a set or that the Dependent Choice Schemes holds. We then study failures of instances of collection in symmetric submodels of class forcings.
Cite
@article{arxiv.2009.01127,
title = {Taking Reinhardt's Power Away},
author = {Richard Matthews},
journal= {arXiv preprint arXiv:2009.01127},
year = {2021}
}
Comments
20 pages. Expanded the proof of Theorem 2.2, corrected the notation in Section 6