Isolation and the high/low hierarchy

&
Archive for Mathematical Logic 41 (3):259-266 (2002)
  Copy   BIBTEX

Abstract

Say that a d.c.e. degree d is isolated by a c.e. degree b, if bMathematics Subject Classification (2000): 03D25, 03D30, 03D35 RID=""ID="" Key words or phrases: Computably enumerable set – d.c.e. degree – Isolation – High/low hierarchy RID=""ID="" Ishmukhametov's research is supported by RFBR grant 01-01-00733, and Wu's research is supported by the Marsden Fund of New Zealand. Wu would like to thank his supervisor, Prof. Rod Downey, for his many helpful suggestions and comments

Categories

Keywords

Reprint years

DOI

10.1007/s001530100111

Links

PhilArchive



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

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

Isolation in the CEA hierarchy.Geoffrey LaForte - 2005 - Archive for Mathematical Logic 44 (2):227-244.
Joining to high degrees via noncuppables.Jiang Liu & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (2):195-211.
On the distribution of Lachlan nonsplitting bases.S. Barry Cooper, Angsheng Li & Xiaoding Yi - 2002 - Archive for Mathematical Logic 41 (5):455-482.
Isolation and lattice embeddings.Guohua Wu - 2002 - Journal of Symbolic Logic 67 (3):1055-1064.
On relative enumerability of Turing degrees.Shamil Ishmukhametov - 2000 - Archive for Mathematical Logic 39 (3):145-154.
A hierarchy for the plus cupping Turing degrees.Yong Wang & Angsheng Li - 2003 - Journal of Symbolic Logic 68 (3):972-988.
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.
Properly [image] Enumeration Degrees and the High/Low Hierarchy.Matthew Giorgi, Andrea Sorbi & Yue Yang - 2006 - Journal of Symbolic Logic 71 (4):1125 - 1144.
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 r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.
An almost-universal cupping degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.
A high noncuppable $${\Sigma^0_2}$$ e-degree.Matthew B. Giorgi - 2008 - Archive for Mathematical Logic 47 (3):181-191.
Bi-Isolation in the D.C.E. Degrees.Guohua Wu - 2004 - Journal of Symbolic Logic 69 (2):409 - 420.
On a problem of Ishmukhametov.Chengling Fang, Guohua Wu & Mars Yamaleev - 2013 - Archive for Mathematical Logic 52 (7-8):733-741.
A high strongly noncappable degree.Steffen Lempp - 1988 - Journal of Symbolic Logic 53 (1):174-187.

Analytics

Added to PP
2013-11-23

Downloads
46 (#345,717)

6 months
10 (#268,644)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Isolation and lattice embeddings.Guohua Wu - 2002 - Journal of Symbolic Logic 67 (3):1055-1064.
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.
Nonisolated degrees and the jump operator.Guohua Wu - 2002 - Annals of Pure and Applied Logic 117 (1-3):209-221.
Isolation in the CEA hierarchy.Geoffrey LaForte - 2005 - Archive for Mathematical Logic 44 (2):227-244.
Extending and interpreting Post’s programme.S. Cooper - 2010 - Annals of Pure and Applied Logic 161 (6):775-788.

View all 10 citations / Add more citations

References found in this work

The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Isolation and the Jump Operator.Guohua Wu - 2001 - Mathematical Logic Quarterly 47 (4):525-534.
Isolated d.r.e. degrees are dense in r.e. degree structure.Decheng Ding & Lei Qian - 1996 - Archive for Mathematical Logic 36 (1):1-10.
On the r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.

Add more references