Minimal degrees recursive in 1-generic degrees (Q750429)

The authors prove the following theorem: There is a 1-generic degree bounding a minimal degree below \(\underline 0'\); the 1-generic degree may be chosen to lie below \(\underline 0''\). The proof uses in an essential way the notion of \(\Sigma_ 1\)-dense set of strings (for a set W of binary strings, D(W) is the set of all substrings in W; if \(M\subset \omega\) and W is r.e., then W is dense in M if every initial segment of M is extended by some member of W; an r.e. sequence Y of strings is \(\Sigma_ 1\)-dense if no member of Y is an initial segment of M and for every W, dense in M, some member of W extends a member of Y).