\(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets (Q1919553): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Lattice of Recursively Enumerable Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hyperarithmetical Index Sets in Recursion Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3480023 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursively enumerable sets and degrees / rank | |||
Normal rank | |||
Latest revision as of 13:39, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets |
scientific article |
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
