Upper bounds on ideals in the computably enumerable Turing degrees (Q639654): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:50, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on ideals in the computably enumerable Turing degrees |
scientific article |
Statements
Upper bounds on ideals in the computably enumerable Turing degrees (English)
0 references
22 September 2011
0 references
In this paper the following interesting results are obtained. Every proper \(\Sigma^0_4\) ideal of the c.e. Turing degrees has an incomplete upper bound. Every proper \(\Sigma^0_3\) ideal in the c.e. Turing degrees has a low\(_2\) upper bound. The partial order of \(\Sigma^0_3\) ideals under inclusion in the c.e. degrees is dense.
0 references
Turing degrees
0 references
ideals
0 references
arithmetical hierarchy
0 references
