Quasi-minimal enumeration degrees and minimal Turing degrees (Q1568759): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:16, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quasi-minimal enumeration degrees and minimal Turing degrees |
scientific article |
Statements
Quasi-minimal enumeration degrees and minimal Turing degrees (English)
0 references
20 August 2000
0 references
The principal result in this paper is the following: Theorem. There exist an e-degree \({\mathbf a}\) and a family of e-degrees \(\{{\mathbf b}_i: i\in I\}\) of cardinality \(2^{\aleph_0}\) such that for all \(i\in I\), (i) \({\mathbf b}_i\) is minimal total, (ii) \({\mathbf a}\) is quasi-minimal, (iii) \({\mathbf a}<{\mathbf b}_i\). Answering a related question raised by Solon, it is shown that there exists a nontotal enumeration degree which is not e-hyperimmune.
0 references
Turing degrees
0 references
e-degree
0 references
enumeration degree
0 references