Splitting properties of n-c.e. enumeration degrees
AbstractIt is proved that if 1 < m < 2p ≤ n for some integer p then the elementary theories of posets of m-c.e. and n-c.e. e-degrees are distinct. It is proved also that the structures 〈2n, ≤, 〉 and 〈2n, ≤. P〉 are not elementary equivalent where P is the predicate P(a) = “a is a e-degree”.
1992 ◽
Vol 31
(4)
◽
pp. 277-285
◽
Keyword(s):
2019 ◽
pp. 303-330
◽
Keyword(s):
2010 ◽
Vol 22
(4)
◽
pp. 927-952
◽
Keyword(s):
Keyword(s):