\(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets (Q1919553)
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 lattice of recursively enumerable sets |
scientific article; zbMATH DE number 908480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets |
scientific article; zbMATH DE number 908480 |
Statements
\(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets (English)
0 references
12 May 1997
0 references
The author shows that the index set of the major subsets is \(\Sigma_5\)-complete. This answers a question left open by Lempp in 1987. The ``iterated-trees'' method is used in the proof.
0 references
recursively enumerable set
0 references
hierarchy
0 references
index set
0 references
0 references
0 references
