The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable (Q4211072)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 1198494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable |
scientific article; zbMATH DE number 1198494 |
Statements
The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable (English)
0 references
10 September 1998
0 references
computably enumerable degrees
0 references
recursively enumerable degrees
0 references
\(\Pi_3\)-theory
0 references
fragment of first-order theory
0 references
undecidability
0 references
Turing degrees
0 references
0 references
0.8772454857826233
0 references
0.8381385207176208
0 references
0.815029501914978
0 references
0.7974631786346436
0 references
