Abstract
We examine notions of genericity intermediate between 1-genericity and 2-genericity, especially in relation to the Δ 2 0 degrees. We define a new kind of genericity, dynamic genericity, and prove that it is stronger than pb-genericity. Specifically, we show there is a Δ 2 0 pb-generic degree below which the pb-generic degrees fail to be downward dense and that pb-generic degrees are downward dense below every dynamically generic degree. To do so, we examine the relation between genericity and array noncomputability, deriving some structural information about the Δ 2 0 degrees in the process.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
