On the r. e. predecessors of d. r. e. degrees (Q1306796)
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 1348048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the r. e. predecessors of d. r. e. degrees |
scientific article; zbMATH DE number 1348048 |
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
0.73810977
0 references
0 references
0 references
