Difference between revisions of "User talk:Rkossak"
From Peano's Parlour
| Line 5: | Line 5: | ||
| − | The answer | + | The answer if `yes' is either $(M,X)\not\models PA^*$ or ${\rm Th}(M,X)\notin {\rm SSy}(M)$. |
Revision as of 07:14, 8 January 2013
Suppose $M$ is countable recursively saturated and $X$ is an undefinable subset of $M$. Is there a countable recursively saturated $N$ such that $N$ is an elementary end extension of $M$, and if $Y \subseteq M$ is coded in $N$, then $(M,Y) \not\equiv (M,X)$?
The answer if `yes' is either $(M,X)\not\models PA^*$ or ${\rm Th}(M,X)\notin {\rm SSy}(M)$.
