English

Minimal elementary end extensions

Logic 2016-09-09 v3

Abstract

Suppose that M{\mathcal M} is a model of PA and N{\mathcal N} is a countably generated elementary end extension of M{\mathcal M}. Let X{\mathfrak X} be the set of subsets of M that are coded by N{\mathcal N}. Then M{\mathcal M} has a minimal elementary end extension that codes exactly the same subsets of M that N{\mathcal N} does iff every set that is Π10\Pi_1^0-definable in (M,X)({\mathcal M},{\mathfrak X}) is the union of countably many sets that are Σ10\Sigma_1^0-definable.

Keywords

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

R2 v1 2026-06-22T12:14:36.225Z