On the r. e. predecessors of d. r. e. degrees (Q1306796)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the r. e. predecessors of d. r. e. degrees |
scientific article |
Statements
On the r. e. predecessors of d. r. e. degrees (English)
0 references
23 August 2000
0 references
The author investigates the relationship between the recursively enumerable (r.e.) degrees, \(n\)-r.e. degrees and \(n\)-REA degrees for \(n\in\omega\). The following main results are obtained. (i) There are a d.r.e. degree \(d\) and an r.e. degree \(b\) below \(d\) such that \(b\) is just the minimum r.e. degree in which \(d\) is r.e. (ii) There exists an exact d.r.e. degree \(d>0\). (iii) There exists an isolated non-exact d.r.e. degree \(d>0\).
0 references
d.r.e. degrees
0 references
T-degrees
0 references
recursively enumerable degrees
0 references
\(n\)-r.e. degrees
0 references
\(n\)-REA degrees
0 references