科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we prove that a degree a is array nonrecursive (ANR) if and only if every degree b >= a is re. 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.
- 出版日期2012-3
