Quasi-minimal enumeration degrees and minimal Turing degrees (Q1568759): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial degrees and the density problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Properly Σ2 Enumeration Degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reducibility and Completeness for Sets of Integers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5812175 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution to a Problem of Spector / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The \(n\)-rea enumeration degrees are dense / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3329452 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5848894 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classical recursion theory. Vol. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3362657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some filters and ideals of the Medvedev lattice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On degrees of recursive unsolvability / rank | |||
Normal rank |
Latest revision as of 16:53, 29 May 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