Initial segments of degrees below 0′

DOI10.1090/memo/0241zbMath0472.03033OpenAlexW2083737626MaRDI QIDQ3926565

Richard L. Epstein

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

zbMATH Keywords

first-order arithmeticembedding resultshigh degreenon recursive recursively enumerable degree

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (7)

Bounding minimal degrees by computably enumerable degrees ⋮ Complementing below recursively enumerable degrees ⋮ Working below a high recursively enumerable degree ⋮ Degrees bounding minimal degrees ⋮ Computably enumerable Turing degrees and the meet property ⋮ Decidability and Invariant Classes for Degree Structures ⋮ On a problem of Cooper and Epstein

This page was built for publication: Initial segments of degrees below 0′