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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.