Contiguity and distributivity in the enumerable Turing degrees (Q4382472)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1130652
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Contiguity and distributivity in the enumerable Turing degrees |
scientific article; zbMATH DE number 1130652 |
Statements
Contiguity and distributivity in the enumerable Turing degrees (English)
0 references
19 October 1998
0 references
contiguous degree
0 references
recursively enumerable degree
0 references
enumerable Turing degree
0 references
\(m\)-topped degree
0 references
0.8371701836585999
0 references
0.8276417851448059
0 references
0.7934439778327942
0 references
In this very interesting paper it is proved that: (i) A recursively enumerable degree is contiguous iff it is locally distributive. This settles an old question going back to Ladner and Sasso. An enumerable Turing degree in which all the (not necessarily enumerable) sets are of the same weak truth table degree is strongly contiguous. (ii) The notions of strong contiguity and continuity coincide. This settles a question of R. G. Downey. (iii) No \(m\)-topped degree is contiguous. This settles a question of R. G. Downey and C. Jockusch.
0 references
