Article contents
Array nonrecursiveness and relative recursive enumerability
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2012
References
REFERENCES



- 1
- Cited by