Hypersimple sets with retraceable complements

DOI10.1007/BF02219729MaRDI QIDQ2560237zbMATH OpenOpenAlexFDO

Authors A. N. Degtev

Publication date 1972

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02219729

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites work

• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• On the Degrees of Index Sets. II
• Recursively Enumerable Sets and Retracing Functions
• Relationships Between Reducibilities
• Retraceable Sets and Recursive Permutations
• Semirecursive Sets and Positive Reducibility
• The recursively enumerable degrees are dense
• Turing degrees and many-one degrees of maximal sets

Cited in

(9)

• Comparison of linear reducibility with other reducibilities of tabular type
• tt-degrees of recursively enumerable Turing degrees. II
• Weakly semirecursive sets and r.e. orderings
• m-powers of simple sets
• Strong reducibilities
• Busy beaver sets and the degrees of unsolvability
• On the Relations between Some Rate-of-Growth Conditions
• Recursively enumerable sets and degrees
• Relations between table-type degrees

This page was built for publication: Hypersimple sets with retraceable complements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2560237)