Initial segments of degrees below 0′

DOI10.1090/MEMO/0241zbMATH Open0472.03033OpenAlexW2083737626MaRDI QIDQ3926565FDOQ3926565

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

embedding resultsfirst-order arithmetichigh degreenon recursive recursively enumerable degree

Mathematics Subject Classification ID

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

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3926565)