Minimal elementary end extensions
arXiv:1512.06478
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.
arXiv commentThis 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