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

DOI10.1016/0168-0072(95)00055-0zbMath0861.03037OpenAlexW2051891080MaRDI QIDQ1919553

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)00055-0

zbMATH Keywords

index setrecursively enumerable sethierarchy

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• Hyperarithmetical Index Sets in Recursion Theory
• Recursively enumerable sets and degrees
• On the Lattice of Recursively Enumerable Sets

This page was built for publication: \(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets