Abstract
In this paper we prove that a degree a is array nonrecursive (ANR) if and only if every degree b≥a is r.e. in and strictly above another degree (RRE). This result will answer some questions in [ASDWY]. We also deduce an interesting corollary that every n-REA degree has a strong minimal cover if and only if it is array recursive.
Citation
Mingzhong Cai. "Array nonrecursiveness and relative recursive enumerability." J. Symbolic Logic 77 (1) 21 - 32, March 2012. https://doi.org/10.2178/jsl/1327068689
Information
