An almost deep degree

, &
Journal of Symbolic Logic 66 (2):881-901 (2001)
  Copy   BIBTEX

Abstract

We show there is a non-recursive r.e. set A such that if W is any low r.e. set, then the join W $\oplus$ A is also low. That is, A is "almost deep". This answers a question of Jockusch. The almost deep degrees form an definable ideal in the r.e. degrees (with jump.)

Categories

Keywords

Reprint years

DOI

10.2307/2695051

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

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

An Almost Deep Degree.Peter Cholak, Marcia Groszek & Theodore Slaman - 2001 - Journal of Symbolic Logic 66 (2):881-901.
A limit on relative genericity in the recursively enumerable sets.Steffen Lempp & Theodore A. Slaman - 1989 - Journal of Symbolic Logic 54 (2):376-395.
Infima in the d.r.e. degrees.D. Kaddah - 1993 - Annals of Pure and Applied Logic 62 (3):207-263.
The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
An almost-universal cupping degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.
On the Jumps of the Degrees Below a Recursively Enumerable Degree.David R. Belanger & Richard A. Shore - 2018 - Notre Dame Journal of Formal Logic 59 (1):91-107.
Friedberg splittings of recursively enumerable sets.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 59 (3):175-199.
Weak Density and Nondensity among Transfinite Levels of the Ershov Hierarchy.Yong Liu & Cheng Peng - 2020 - Notre Dame Journal of Formal Logic 61 (4):521-536.
Weak Presentations of Computable Fields.Carl G. Jockusch & Alexandra Shlapentokh - 1995 - Journal of Symbolic Logic 60 (1):199 - 208.

Analytics

Added to PP
2009-01-28

Downloads
65 (#255,731)

6 months
12 (#242,943)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Randomness and computability: Open questions.Joseph S. Miller & André Nies - 2006 - Bulletin of Symbolic Logic 12 (3):390-410.
Benign cost functions and lowness properties.Noam Greenberg & André Nies - 2011 - Journal of Symbolic Logic 76 (1):289 - 312.
Parameter definability in the recursively enumerable degrees.André Nies - 2003 - Journal of Mathematical Logic 3 (01):37-65.
Strong Jump-Traceability.Noam Greenberg & Dan Turetsky - 2018 - Bulletin of Symbolic Logic 24 (2):147-164.
Quasi-complements of the cappable degrees.Guohua Wu - 2004 - Mathematical Logic Quarterly 50 (2):189.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references