\(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets
From MaRDI portal
Publication:1919553
DOI10.1016/0168-0072(95)00055-0zbMath0861.03037MaRDI QIDQ1919553
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
03D25: Recursively (computably) enumerable sets and degrees
03D55: Hierarchies of computability and definability
Related Items
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