Minimal degrees of unsolvability and the full approximation construction
From MaRDI portal
Publication:4074893
DOI10.1090/memo/0162zbMath0315.02043MaRDI 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
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
On a problem of Cooper and Epstein, A superhigh diamond in the c.e. tt-degrees, Complementing below recursively enumerable degrees, A single minimal complement for the c.e. degrees, Degrees bounding minimal degrees, Bounding minimal degrees by computably enumerable degrees