User talk:Rkossak

From Peano's Parlour
Revision as of 08: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...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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 YM is coded in N, then (M,Y)(M,X)?


The answer is `yes' is either (M,X)\SPA or \Th(M,X)\SSy(M).