User talk:Rkossak
From Peano's Parlour
Revision as of 07:11, 8 January 2013 by Rkossak (Talk | contribs) (Created page with "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 exten...")
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 is `yes' is either $(M,X)\not\models\SPA$ or $\Th(M,X)\notin\SSy(M)$.
