Array nonrecursiveness and relative recursive enumerability
AbstractIn 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.
2013 ◽
Vol 34
(12)
◽
pp. 2905-2912
1967 ◽
Vol 10
(4)
◽
pp. 595-596
◽
Keyword(s):
Keyword(s):
1970 ◽
Vol 2
(2)
◽
pp. 261-265
Keyword(s):
2001 ◽
Vol 267
(1-2)
◽
pp. 3-16
◽
Keyword(s):
1986 ◽
Vol 31
◽
pp. 87-120
◽
Keyword(s):
1994 ◽
Vol 33
(5)
◽
pp. 321-346
◽
Keyword(s):
2015 ◽
Vol 89
◽
pp. 569-583
◽