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
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,694
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
140 ( #35,354 of 2,197,196 )

Recent downloads (6 months)
1 ( #298,376 of 2,197,196 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature