Cupping and definability in the local structure of the enumeration degrees

Journal of Symbolic Logic 77 (1):133-158 (2012)
  Copy   BIBTEX

Abstract

We show that every splitting of ${0}_{\mathrm{e}}^{\prime }$ in the local structure of the enumeration degrees, $$\mathcal{G}_{e} , contains at least one low-cuppable member. We apply this new structural property to show that the classes of all $\mathcal{K}$ -pairs in $\mathcal{G}_{e}$ , all downwards properly ${\mathrm{\Sigma }}_{2}^{0}$ enumeration degrees and all upwards properly ${\mathrm{\Sigma }}_{2}^{0}$ enumeration degrees are first order definable in $\mathcal{G}_{e}$

Links

PhilArchive



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

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

A hierarchy for the plus cupping Turing degrees.Yong Wang & Angsheng Li - 2003 - Journal of Symbolic Logic 68 (3):972-988.
The cupping theorem in r/m.Sui Yuefei & Zhang Zaiyue - 1999 - Journal of Symbolic Logic 64 (2):643-650.
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.
Definability and initial segments of c-degrees.Robert S. Lubarsky - 1988 - Journal of Symbolic Logic 53 (4):1070-1081.

Analytics

Added to PP
2012-01-21

Downloads
21 (#720,615)

6 months
10 (#255,509)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The automorphism group of the enumeration degrees.Mariya I. Soskova - 2016 - Annals of Pure and Applied Logic 167 (10):982-999.

Add more citations

References found in this work

Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.
Computability Theory.Barry Cooper - 2010 - Journal of the Indian Council of Philosophical Research 27 (1).
Definability of the jump operator in the enumeration degrees.I. Sh Kalimullin - 2003 - Journal of Mathematical Logic 3 (02):257-267.

View all 10 references / Add more references