Partially-elementary end extensions of countable admissible sets
Logic
2022-01-14 v1
Abstract
A result of Kaufmann shows that if is countable, admissible and satisfies , then has a proper -elementary end extension. This paper investigates to what extent the theory that holds in can be transferred to the partially-elementary end extensions guaranteed by Kaufmann's result. We show that there are satisfying full separation, powerset and that have no proper -elementary end extension satisfying either or . In contrast, we show that if is a countable admissible set that satisfies and is a recursively enumerable theory that holds in , then has a proper -elementary end extension that satisfies .
Cite
@article{arxiv.2201.04817,
title = {Partially-elementary end extensions of countable admissible sets},
author = {Zachiri McKenzie},
journal= {arXiv preprint arXiv:2201.04817},
year = {2022}
}
Comments
13 pages