The continuity of cupping to \(\text \textbf{0}'\) (Q1314642): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4694275 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040892 / rank | |||
Normal rank |
Latest revision as of 13:06, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The continuity of cupping to \(\text \textbf{0}'\) |
scientific article |
Statements
The continuity of cupping to \(\text \textbf{0}'\) (English)
0 references
29 January 1995
0 references
Let \({\mathbf a}\) and \({\mathbf b}\) be recursively enumerable (r.e.) Turing degrees less than \(\mathbf{0}'\) such that \({\mathbf a}\cup {\mathbf b}=\text{\textbf{0}}'\). A degree \({\mathbf c}\) is called a major subdegree of \({\mathbf a}\) if \({\mathbf c}< {\mathbf a}\) and \({\mathbf c}\cup {\mathbf b}= \mathbf{0}'\). It is unknown whether every r.e. degree \({\mathbf a}\) except \(\mathbf{0}\) and \(\mathbf{0}'\) has a major subdegree. In the paper, a group of well-known specialists gives a particular answer to this question.
0 references
Turing degrees
0 references
major subdegree
0 references