\(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees (Q1919542)
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: \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees |
scientific article; zbMATH DE number 908470
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees |
scientific article; zbMATH DE number 908470 |
Statements
\(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees (English)
0 references
12 May 1997
0 references
The author proves that the index set of the cuppable r.e. sets is \(\Sigma_5\)-complete. The ``iterated trees of strategies'' which were developed by Lempp and Lerman are used in the proof.
0 references
recursively enumerable degree
0 references
Turing degree
0 references
index set
0 references
0 references
0 references
