A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE

DOI10.1017/jsl.2018.68zbMath1444.03135OpenAlexW2987909001MaRDI QIDQ5207555

Satyadev Nandakumar, Rodney G. Downey

Publication date: 10 January 2020

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

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

zbMATH Keywords

minimal degreeTuring degreeweakly 2-generic

Mathematics Subject Classification ID

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

Related Items (1)

Multiple genericity: a new transfinite hierarchy of genericity notions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal degrees recursive in 1-generic degrees
• On degrees of recursive unsolvability
• On \(\Pi{}^ 0_ 1\) classes and their ranked points
• Arithmetical Sacks forcing
• The typical Turing degree
• Algorithmic Randomness and Complexity
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• A 1-generic degree which bounds a minimal degree
• The degrees below a 1-generic degree < 0′
• Degrees bounding minimal degrees
• Minimal degrees and the jump operator
• The Information Content of Typical Reals
• Initial segments of the degrees of unsolvability Part II: minimal degrees

This page was built for publication: A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE