A hierarchy for cuppable degrees (Q1584492): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Ang Sheng Li / rank | |||
Property / reviewed by | |||
Property / reviewed by: Q587564 / rank | |||
Property / author | |||
Property / author: Ang Sheng Li / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Roland Sh. Omanadze / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:00, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A hierarchy for cuppable degrees |
scientific article |
Statements
A hierarchy for cuppable degrees (English)
0 references
3 September 2001
0 references
A c.e. degree \({\mathbf a}\) is called cuppable if there is a c.e. degree \({\mathbf b}\neq\mathbf{0}'\) such that \({\mathbf a}\vee {\mathbf b}= \mathbf{0}'\). A c.e. degree \({\mathbf a}\) is called \(\text{low}_n\)-cuppable, \(n>0\), if there is a \(\text{low}_n\) c.e. degrees \({\mathbf c}\) such that \({\mathbf a}\vee {\mathbf c}=\mathbf{0}'\). Let \(\text{LC}_n\) be the set of all \(\text{low}_n\)-cuppable c.e. degrees. In this paper it is proved that \(\text{LC}_1 \subset \text{LC}_2\).
0 references
computably enumerable degrees
0 references
\(\text{low}_n\)-cuppable degrees
0 references