Initial segments of degrees below 0′
From MaRDI portal
Publication:3926565
DOI10.1090/memo/0241zbMath0472.03033MaRDI QIDQ3926565
Publication date: 1981
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/memo/0241
03D35: Undecidability and degrees of sets of sentences
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Working below a high recursively enumerable degree, On a problem of Cooper and Epstein, Complementing below recursively enumerable degrees, Decidability and Invariant Classes for Degree Structures, Degrees bounding minimal degrees, Bounding minimal degrees by computably enumerable degrees