The density of the low\(_ 2\) \(n\)-r.e. degrees (Q1179531): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Weak density and cupping in the d-r.e. degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: D.R.E. Degrees and the Nondiamond Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump restricted interpolation in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees less than 0' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Working below a high recursively enumerable degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank

Latest revision as of 12:48, 15 May 2024

scientific article
Language Label Description Also known as
English
The density of the low\(_ 2\) \(n\)-r.e. degrees
scientific article

    Statements

    The density of the low\(_ 2\) \(n\)-r.e. degrees (English)
    0 references
    0 references
    26 June 1992
    0 references
    Recall that for the degree \(\underset\tilde{} c\) to be low\(_ 2\) is to have \(\underset\tilde{} c'' = \underset\tilde{} 0''\). This paper's theorem proves that for any \(n \geq 1\), if \(\underset\tilde{} a\) and \(\underset\tilde{} b\) are low\(_ 2\) \(n\)-r.e. degrees with \(\underset\tilde{} b < \underset\tilde{} a\), then there are \(n\)- r.e. degrees \(\underset\tilde{} c\) and \(\underset\tilde{} d\) that lie properly between \(\underset\tilde{} b\) and \(\underset\tilde{} a\) and whose join is \(\underset\tilde{} a\). Since low\(_ 2\) degrees can have only low\(_ 2\) degrees between them, it follows immediately that, for each \(n \geq 1\), the low\(_ 2\) \(n\)-r.e. degrees are dense. For \(n=2\) this says that the low\(_ 2\) \(d\)-r.e. degrees are dense. A forthcoming paper by the author and others shows that density fails for the full family of d-r.e. degrees. The theorem is proved first for the case \(n=2\), adapting ideas due to Harrington. The full result follows by a straightforward induction.
    0 references
    density
    0 references
    low\(_ 2\) \(n\)-r.e. degrees
    0 references

    Identifiers