Minimal degrees of unsolvability and the full approximation construction
From MaRDI portal
Publication:4074893
DOI10.1090/memo/0162zbMath0315.02043OpenAlexW2145265838MaRDI QIDQ4074893
Publication date: 1975
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/memo/0162
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (6)
Bounding minimal degrees by computably enumerable degrees ⋮ Complementing below recursively enumerable degrees ⋮ A superhigh diamond in the c.e. tt-degrees ⋮ Degrees bounding minimal degrees ⋮ A single minimal complement for the c.e. degrees ⋮ On a problem of Cooper and Epstein
This page was built for publication: Minimal degrees of unsolvability and the full approximation construction
