The distribution of the generic recursively enumerable degrees (Q688848)

Problems of densities of \(e\)-generic, \(s\)-generic and \(p\)-generic degrees are investigated and the following theorems are proved. Theorem 3.1. Let \({\mathbf a}\) be \(p\)-generic. Then \({\mathbf a}\) is non-branching. Corollary 3.3. The non-\(p\)-generic degrees are dense in the r.e. degrees. This theorem affirmatively answers a question raised by \textit{C. G. Jockusch} [Lect. Notes Math. 1141, 203-232 (1985; Zbl 0594.03024)] and Corollary 3.3 refutes a conjecture of \textit{M. Ingrassia} [``\(P\)-genericity for recursively enumerable sets'', Ph. D. Diss., Univ. Illinois at Urbana-Champaign (1981)]. Theorem 4.1. The \(e\)-generic degrees are nowhere dense. Theorem 4.2. Let \({\mathbf d}\), \({\mathbf b}\) be r.e. degrees such that \({\mathbf d}\) is low and \({\mathbf d}<_ T{\mathbf b}\). Then there is an \(s\)-generic degree \({\mathbf a}\) such that \({\mathbf d}\leq_ T{\mathbf a}\leq_ T{\mathbf b}\). Theorem 5.1. Let \({\mathbf b}\) be a low r.e. degree. Then there is a low r.e. degree \({\mathbf a}\geq{\mathbf b}\) such that \({\mathbf a}\) is \(p\)-generic but not \(s\)-generic.