Splitting properties of n-c.E. Enumeration degrees

Journal of Symbolic Logic 67 (2):537-546 (2002)

It is proved that if 1 $\langle \mathscr{D}_{2n}, \leq, P\rangle$ and $\langle \mathscr{D}_{2n}, \leq, P\rangle$ are not elementary equivalent where P is the predicate P(a) = "a is a Π 0 1 e-degree"
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1190150096
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 39,607
Through your library

References found in this work BETA

Density Results in the Δ20 E-Degrees.Marat M. Arslanov, Iskander Sh Kalimullin & Andrea Sorbi - 2001 - Archive for Mathematical Logic 40 (8):597-614.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
173 ( #38,194 of 2,325,322 )

Recent downloads (6 months)
18 ( #37,394 of 2,325,322 )

How can I increase my downloads?


My notes

Sign in to use this feature