The existence of high nonbounding degrees in the difference hierarchy

, &
Annals of Pure and Applied Logic 138 (1):31-51 (2006)
  Copy   BIBTEX

Abstract

We study the jump hierarchy of d.c.e. Turing degrees and show that there exists a high d.c.e. degree d which does not bound any minimal pair of d.c.e. degrees

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2005.06.005

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

My notes

Similar books and articles

On the Definable Ideal Generated by Nonbounding C.E. Degrees.Liang Yu & Yue Yang - 2005 - Journal of Symbolic Logic 70 (1):252 - 270.
On the distribution of Lachlan nonsplitting bases.S. Barry Cooper, Angsheng Li & Xiaoding Yi - 2002 - Archive for Mathematical Logic 41 (5):455-482.
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.
Relative enumerability in the difference hierarchy.Marat M. Arslanov, Geoffrey L. Laforte & Theodore A. Slaman - 1998 - Journal of Symbolic Logic 63 (2):411-420.
Properly [image] Enumeration Degrees and the High/Low Hierarchy.Matthew Giorgi, Andrea Sorbi & Yue Yang - 2006 - Journal of Symbolic Logic 71 (4):1125 - 1144.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
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.
Bounded query classes and the difference hierarchy.Richard Beigel, William I. Gasarch & Louise Hay - 1989 - Archive for Mathematical Logic 29 (2):69-84.
Complementing cappable degrees in the difference hierarchy.Rod Downey, Angsheng Li & Guohua Wu - 2004 - Annals of Pure and Applied Logic 125 (1-3):101-118.
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.
Nonhemimaximal degrees and the high/low hierarchy.Fang Chengling & Wu Guohua - 2012 - Journal of Symbolic Logic 77 (2):433-446.
There is no ordering on the classes in the generalized high/low hierarchies.Antonio Montalbán - 2006 - Archive for Mathematical Logic 45 (2):215-231.
A high c.e. degree which is not the join of two minimal degrees.Matthew B. Giorgi - 2010 - Journal of Symbolic Logic 75 (4):1339-1358.

Analytics

Added to PP
2013-12-31

Downloads
14 (#968,362)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Andy Li
Shanghai JiaoTong University
Yingluo Yang
Renmin University of China

Citations of this work

Bounding computably enumerable degrees in the Ershov hierarchy.Angsheng Li, Guohua Wu & Yue Yang - 2006 - Annals of Pure and Applied Logic 141 (1):79-88.

Add more citations

References found in this work

Bounding minimal pairs.A. H. Lachlan - 1979 - Journal of Symbolic Logic 44 (4):626-642.
Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Working below a low2 recursively enumerably degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.
Isolation and the high/low hierarchy.Shamil Ishmukhametov & Guohua Wu - 2002 - Archive for Mathematical Logic 41 (3):259-266.

View all 8 references / Add more references