Journal of Symbolic Logic 77 (1):21-32 (2012)

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1327068689
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,308
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
22 ( #442,016 of 2,326,038 )

Recent downloads (6 months)
1 ( #650,227 of 2,326,038 )

How can I increase my downloads?


My notes