Undecidability and 1-types in intervals of the computably enumerable degrees (Q1591201): Difference between revisions
From MaRDI portal
Latest revision as of 11:58, 3 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Undecidability and 1-types in intervals of the computably enumerable degrees |
scientific article |
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
