Abstract
A result of Kaufmann shows that if is countable, admissible and satisfies , then has a proper -elementary end extension. This paper investigates to what extent the theory that holds in can be transferred to the partially-elementary end extensions guaranteed by Kaufmann's result. We show that there are satisfying full separation, powerset and that have no proper -elementary end extension satisfying either or . In contrast, we show that if is a countable admissible set that satisfies and is a recursively enumerable theory that holds in , then has a proper -elementary end extension that satisfies .
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.