Uniform upper bounds on ideals of turing degrees

DOI10.2307/2273535zbMath0389.03017OpenAlexW1991944027MaRDI QIDQ4170709

Harold T. Hodes

Publication date: 1978

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273535

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10)

Related Items (2)

Upper bounds for the arithmetical degrees ⋮ Degrees of Recursively Saturated Models

Cites Work

• Unnamed Item
• Unnamed Item
• A degree-theoretic definition of the ramified analytical hierarchy
• On the notational independence of various hierarchies of degrees of unsolvability

This page was built for publication: Uniform upper bounds on ideals of turing degrees