Splitting properties of {$n$}-c.e. enumeration degrees

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

Abstract

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"

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,401

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
194 (#130,490)

6 months
6 (#572,300)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

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

Add more references