Article contents
Splitting properties of n-c.e. enumeration degrees
Published online by Cambridge University Press: 12 March 2014
Abstract
It 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”.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2002
References
REFERENCES
- 3
- Cited by