zbMATH — the first resource for mathematics

Array nonrecursive degrees and genericity. (English) Zbl 0849.03029
Cooper, S. B. (ed.) et al., Computability, enumerability, unsolvability. Directions in recursion theory. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 224, 93-104 (1996).
The paper continues the study of a special kind of recursively enumerable sets called array nonrecursive sets (a.n.s.). The degrees of a.n.s. contain all degrees which satisfy \({\mathbf a}'' > ({\mathbf a} \cup \mathbf{0}')'\). Some interesting results are obtained. It is shown that the set of a.n. degrees is the upward closure of the pb-generic degrees.
For the entire collection see [Zbl 0830.00006].

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