Classes bounded by incomplete sets

DOI10.1016/S0168-0072(01)00114-2zbMath1002.03033OpenAlexW2076082825MaRDI QIDQ1602854

Kejia Ho, Frank Stephan

Publication date: 24 June 2002

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

Full work available at URL: https://doi.org/10.1016/s0168-0072(01)00114-2

zbMATH Keywords

computably enumerable degrees\(m\)-reduciblebounded classeffectively simple setsTuring reducible

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Resource bounded immunity and simplicity

Cites Work

• Unnamed Item
• Unnamed Item
• One class of partial sets
• Classical recursion theory. Vol. II
• Recursion theoretic properties of frequency computation and bounded queries
• T-Degrees, Jump Classes, and Strong Reducibilities
• Reducibility and Completeness for Sets of Integers
• The theory of the recursively enumerable weak truth-table degrees is undecidable
• w tt-Complete Sets are not Necessarily tt-Complete
• Degree theoretic definitions of the low₂ recursively enumerable sets
• On the Degrees of Index Sets. II
• Semirecursive Sets and Positive Reducibility
• Degrees in Which the Recursive Sets are Uniformly Recursive
• A note on universal sets
• A Theorem on Hypersimple Sets
• Creative sets

This page was built for publication: Classes bounded by incomplete sets