Minimal elementary end extensions

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…