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

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1164060448

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,599

External links

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

Through your library

My notes

Similar books and articles

Properly $\Sigma _{2}^{0}$ Enumeration Degrees and the High/Low Hierarchy.Matthew Giorgi, Andrea Sorbi & Yue Yang - 2006 - Journal of Symbolic Logic 71 (4):1125 - 1144.
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.
Cupping and definability in the local structure of the enumeration degrees.Hristo Ganchev & Mariya I. Soskova - 2012 - Journal of Symbolic Logic 77 (1):133-158.
A high noncuppable Σ20{\Sigma^0_2} e-degree.Matthew B. Giorgi - 2008 - Archive for Mathematical Logic 47 (3):181-191.
The Distribution of Properly $Sigma^0_2$ e-Degrees.Stanislaw Bereznyuk, Richard Coles & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):19-32.
Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
The distribution of properly Σ20 e-degrees.Stanislaw Bereznyuk, Richard Coles & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):19-32.
Bounding Nonsplitting Enumeration Degrees.Thomas F. Kent & Andrea Sorbi - 2007 - Journal of Symbolic Logic 72 (4):1405 - 1417.
Cupping and noncupping in the enumeration degrees of ∑20 sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.
Initial segments of the enumeration degrees.Hristo Ganchev & Andrea Sorbi - 2016 - Journal of Symbolic Logic 81 (1):316-325.

Analytics

Added to PP
2010-08-24

Downloads
43 (#573,885)

6 months
3 (#1,181,901)

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