Elementary Differences between the (2p)-C. E. and the (2p + 1)-C. E. Enumeration Degrees

Journal of Symbolic Logic 72 (1):277 - 284 (2007)
  Copy   BIBTEX

Abstract

It is proved that the (2p)-c. e. e-degrees are not elementarily equivalent to the (2p + 1)-c. e. e-degrees for each nonzero p ∈ ω. It follows that m-c. e. e-degrees are not elementarily equivalent to the n-c. e. e-degrees if 1 < m < n

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

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

Noncappable enumeration degrees below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
Uniform enumeration operations.A. H. Lachlan - 1975 - Journal of Symbolic Logic 40 (3):401-409.
1-genericity in the enumeration degrees.Kate Copestake - 1988 - Journal of Symbolic Logic 53 (3):878-887.
Jumps of quasi-minimal enumeration degrees.Kevin McEvoy - 1985 - Journal of Symbolic Logic 50 (3):839-848.

Analytics

Added to PP
2010-08-24

Downloads
36 (#434,037)

6 months
8 (#347,798)

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

No references found.

Add more references