\(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees

DOI10.1016/0168-0072(95)00054-2zbMath0861.03036OpenAlexW2010778740MaRDI QIDQ1919542

Michael A. Jahn

Publication date: 12 May 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(95)00054-2

zbMATH Keywords

index setrecursively enumerable degreeTuring degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Related Items

\(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets

Cites Work

• Degrees which do not bound minimal degrees
• A non-inversion theorem for the jump operator
• \(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets
• A limit on relative genericity in the recursively enumerable sets
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• Hyperarithmetical Index Sets in Recursion Theory
• Recursively enumerable sets and degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item