Degrees bounding minimal degrees

DOI10.1017/S0305004100067694zbMath0677.03031MaRDI QIDQ3832556

Chi Tat Chong, Rodney G. Downey

Publication date: 1989

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

minimal degrees1-generic degreen-generic degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ 1-Generic Degrees Bounding Minimal Degrees Revisited ⋮ 1-generic degrees and minimal degrees in higher recursion theory. II ⋮ Arithmetical Sacks forcing ⋮ A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE ⋮ Minimal degrees recursive in 1-generic degrees

Cites Work

• 1-generic degrees and minimal degrees in higher recursion theory. II
• On degrees of recursive unsolvability
• Degrees which do not bound minimal degrees
• Initial segments of degrees below 0′
• Minimal degrees of unsolvability and the full approximation construction

This page was built for publication: Degrees bounding minimal degrees