Mathematical Logic Quarterly 46 (3):409-416 (2000)

Abstract
We show that for any computably enumerable set A and any equation image set L, if L is low and equation image, then there is a c.e. splitting equation image such that equation image. In Particular, if L is low and n-c.e., then equation image is n-c.e. and hence there is no low maximal n-c.e. degree
Keywords maximal d.c.e.degree  n‐c.e. set  Computably enumerable set
Categories (categorize this paper)
DOI 10.1002/1521-3870(200008)46:3<409::AID-MALQ409>3.0.CO;2-P
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,342
Through your library

References found in this work BETA

The D.R.E. Degrees Are Not Dense.S. Cooper, Leo Harrington, Alistair Lachlan, Steffen Lempp & Robert Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.
The Density of the Low2 N-R.E. Degrees.S. Barry Cooper - 1991 - Archive for Mathematical Logic 31 (1):19-24.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

There is No Low Maximal D. C. E. Degree– Corrigendum.M. Arslanov & S. B. Cooper - 2004 - Mathematical Logic Quarterly 50 (6):628.
The Computably Enumerable Degrees Are Locally Non-Cappable.Matthew B. Giorgi - 2003 - Archive for Mathematical Logic 43 (1):121-139.
Maximal Contiguous Degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
1-Reducibility Inside an M-Degree with Maximal Set.E. Herrmann - 1992 - Journal of Symbolic Logic 57 (3):1046-1056.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
On Lachlan’s Major Sub-Degree Problem.S. Barry Cooper & Angsheng Li - 2008 - Archive for Mathematical Logic 47 (4):341-434.
On a Conjecture of Kleene and Post.S. Barry Cooper - 2001 - Mathematical Logic Quarterly 47 (1):3-34.
A Δ02 Set with Barely Σ02 Degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700 - 1718.
A $Delta^02$ Set with Barely $Sigma^02$ Degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700-1718.
On the Distribution of Lachlan Nonsplitting Bases.S. Barry Cooper, Angsheng Li & Xiaoding Yi - 2002 - Archive for Mathematical Logic 41 (5):455-482.
Prime Models of Computably Enumerable Degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
A Minimal Pair Joining to a Plus Cupping Turing Degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.

Analytics

Added to PP index
2013-12-01

Total views
37 ( #255,906 of 2,326,131 )

Recent downloads (6 months)
2 ( #435,731 of 2,326,131 )

How can I increase my downloads?

Downloads

My notes