Hypersimple sets with retraceable complements
From MaRDI portal
Publication:2560237
DOI10.1007/BF02219729zbMath0259.02031OpenAlexW2020422293MaRDI QIDQ2560237
Publication date: 1972
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02219729
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
On the Relations between Some Rate-of-Growth Conditions ⋮ tt-degrees of recursively enumerable Turing degrees. II ⋮ Weakly semirecursive sets and r.e. orderings ⋮ Recursively enumerable sets and degrees ⋮ Relations between table-type degrees ⋮ m-powers of simple sets ⋮ Strong reducibilities ⋮ Comparison of linear reducibility with other reducibilities of tabular type ⋮ Busy beaver sets and the degrees of unsolvability
Cites Work
- The recursively enumerable degrees are dense
- Recursively Enumerable Sets and Retracing Functions
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- On the Degrees of Index Sets. II
- Relationships Between Reducibilities
- Retraceable Sets and Recursive Permutations
- Semirecursive Sets and Positive Reducibility
- Turing degrees and many-one degrees of maximal sets