Array nonrecursiveness and relative recursive enumerability
Mingzhong Cai · Journal of Symbolic Logic · 2012
Abstract In this paper we prove that a degreeais array nonrecursive (ANR) if and only if every degreeb ≥ ais r.e. in and strictly above another degree (RRE). This result will answer some questions in [ASDWY]. We also deduce an interesting corollary that everyn-REAdegree has a strong minimal cover if and only if it is array recursive.