Properly [image] Enumeration Degrees and the High/Low Hierarchy

Journal of Symbolic Logic 71 (4):1125 - 1144 (2006)
  Copy   BIBTEX

Abstract

We show that there exist downwards properly $\Sigma _{2}^{0}$ (in fact noncuppable) e-degrees that are not high. We also show that every high e-degree bounds a noncuppable e-degree

Links

PhilArchive



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

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
2010-08-24

Downloads
20 (#747,345)

6 months
11 (#222,787)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):491-522.
Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Mathematical Logic Quarterly 34 (6):491-522.
Limit lemmas and jump inversion in the enumeration degrees.Evan J. Griffiths - 2003 - Archive for Mathematical Logic 42 (6):553-562.
The computably enumerable degrees are locally non-cappable.Matthew B. Giorgi - 2003 - Archive for Mathematical Logic -1 (1):1-1.

Add more references