Undecidability and 1-types in intervals of the computably enumerable degrees (Q1591201)
From MaRDI portal
!
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 1546598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Undecidability and 1-types in intervals of the computably enumerable degrees |
scientific article; zbMATH DE number 1546598 |
Statements
Undecidability and 1-types in intervals of the computably enumerable degrees (English)
0 references
23 October 2001
0 references
The authors show that the \(\Pi_5\)-theory of any nontrivial interval \([a,b]\) in the computably enumerable Turing degrees is undecidable in the language \(\left<\leq\right>\) and prove that the elementary theory of this interval has uncountably many 1-types.
0 references
theories of Turing degrees
0 references
undecidable theory
0 references
0 references
0.815029501914978
0 references
0.815029501914978
0 references
0.8112379908561707
0 references
0.8081690073013306
0 references
0.7848619818687439
0 references
