On the problem of definability of the computably enumerable degrees in the difference hierarchy (Q1785041)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the problem of definability of the computably enumerable degrees in the difference hierarchy |
scientific article; zbMATH DE number 6945060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the problem of definability of the computably enumerable degrees in the difference hierarchy |
scientific article; zbMATH DE number 6945060 |
Statements
On the problem of definability of the computably enumerable degrees in the difference hierarchy (English)
0 references
27 September 2018
0 references
difference hierarchy
0 references
Turing degrees
0 references
definable relations
0 references
structural properties
0 references
0.8828728795051575
0 references
0.8055665493011475
0 references
0.8036771416664124
0 references
0.7798102498054504
0 references
