Minimal elementary end extensions
Logic
2016-09-09 v3
Abstract
Suppose that is a model of PA and is a countably generated elementary end extension of . Let be the set of subsets of M that are coded by . Then has a minimal elementary end extension that codes exactly the same subsets of M that does iff every set that is -definable in is the union of countably many sets that are -definable.
Cite
@article{arxiv.1512.06478,
title = {Minimal elementary end extensions},
author = {James H. Schmerl},
journal= {arXiv preprint arXiv:1512.06478},
year = {2016}
}
Comments
This version replaces the previously withdrawn version. Not only has the spelling of the title been corrected, but so has the statement and proof of the main result