Array nonrecursiveness and relative recursive enumerability

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


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



    Upload a copy of this work     Papers currently archived: 91,252

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Relative recursive enumerability of generic degrees.Masahiro Kumabe - 1991 - Journal of Symbolic Logic 56 (3):1075-1084.
Recursive analysis.R. L. Goodstein - 1961 - Mineola, N.Y.: Dover Publications.
Degrees of Relative Provability.Mingzhong Cai - 2012 - Notre Dame Journal of Formal Logic 53 (4):479-489.
Specificity in a global array is only one possibility.Eric L. Amazeen & Guy C. Van Orden - 2004 - Behavioral and Brain Sciences 27 (6):887-888.
Strictly primitive recursive realizability, I.Zlatan Damnjanovic - 1994 - Journal of Symbolic Logic 59 (4):1210-1227.
Recursive functionals.Luis E. Sanchis - 1992 - New York: North-Holland.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.


Added to PP

28 (#542,235)

6 months
2 (#1,182,310)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references