Hypersimplicity and semicomputability in the weak truth table degrees

DOI10.1007/s00153-005-0288-9zbMath1077.03026OpenAlexW1979450836MaRDI QIDQ2576639

George Barmpalias

Publication date: 14 December 2005

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-005-0288-9

zbMATH Keywords

weak truth table degreecomputable orderingshypersimple setshypersimple degrees

Mathematics Subject Classification ID

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

Related Items (4)

A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Π₁⁰ classes and strong degree spectra of relations ⋮ Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees ⋮ Hierarchy of Computably Enumerable Degrees II

Cites Work

• Unnamed Item
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. Vol. II
• Approximation representations for \(\Delta_2\) reals
• Approximation representations for reals and their wtt‐degrees
• The approximation structure of a computably approximable real
• Semirecursive Sets and Positive Reducibility

This page was built for publication: Hypersimplicity and semicomputability in the weak truth table degrees