Degrees bounding minimal degrees

DOI10.1017/S0305004100067694MaRDI QIDQ3832556zbMATH OpenFDO

Authors C. T. Chong, Rodney G. Downey

Publication date 1989

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

Full work available at URL https://doi.org/10.1017/S0305004100067694

zbMATH Keywords

1-generic degreeminimal degreesn-generic degree

Mathematics Subject Classification ID

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

Recommendations

• A 1-generic degree which bounds a minimal degree
• Relative recursive enumerability of generic degrees
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• Every n-generic degree is a minimal cover of an n-generic degree
• Generic degrees are complemented

Cites work

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

Cited in

(21)

• Dynamic notions of genericity and array noncomputability
• Minimizing maximum indegree
• Arithmetical Sacks forcing
• 1-Generic Degrees Bounding Minimal Degrees Revisited
• A 1-generic degree which bounds a minimal degree
• scientific article; zbMATH DE number 3916242 (Why is no real title available?)
• scientific article; zbMATH DE number 4041900 (Why is no real title available?)
• Minimality in the Δ⅓-degrees
• scientific article; zbMATH DE number 4081537 (Why is no real title available?)
• Relative recursive enumerability of generic degrees
• Minimal upper bounds for arithmetical degrees
• A 1-generic degree with a strong minimal cover
• Relative definability of n-generics
• scientific article; zbMATH DE number 221461 (Why is no real title available?)
• Minimal weak truth table degrees and computably enumerable Turing degrees
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• Every n-generic degree is a minimal cover of an n-generic degree
• Minimum Degree Orderings
• There are no maximal low d.c.e. degrees
• 1-generic degrees and minimal degrees in higher recursion theory. II
• Minimal degrees recursive in 1-generic degrees

This page was built for publication: Degrees bounding minimal degrees

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