Difference between revisions of "User talk:Rkossak"

From Peano's Parlour
Jump to: navigation, search
(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...")
 
(Blanked the page)
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
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)$.
 

Latest revision as of 13:12, 16 January 2013