A theorem on minimal degrees

DOI10.2307/2269688zbMath0202.30904OpenAlexW2105112555MaRDI QIDQ5599821

J. R. Shoenfield

Publication date: 1966

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2269688

Related Items (7)

Bounding minimal degrees by computably enumerable degrees ⋮ Complementing below recursively enumerable degrees ⋮ Minimal degrees and the jump operator ⋮ Minimal α-recursion theoretic degrees ⋮ On the structures inside truth-table degrees ⋮ Generic degrees are complemented ⋮ Degrees joining to 0′

Cites Work

• The upper semi-lattice of degrees of recursive unsolvability
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Degrees of Unsolvability. (AM-55)

This page was built for publication: A theorem on minimal degrees