Translator Disclaimer
March 2012 Array nonrecursiveness and relative recursive enumerability
Mingzhong Cai
J. Symbolic Logic 77(1): 21-32 (March 2012). DOI: 10.2178/jsl/1327068689

Abstract

In this paper we prove that a degree a is array nonrecursive (ANR) if and only if every degree ba 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.

Citation

Download Citation

Mingzhong Cai. "Array nonrecursiveness and relative recursive enumerability." J. Symbolic Logic 77 (1) 21 - 32, March 2012. https://doi.org/10.2178/jsl/1327068689

Information

Published: March 2012
First available in Project Euclid: 20 January 2012

zbMATH: 1269.03044
MathSciNet: MR2951627
Digital Object Identifier: 10.2178/jsl/1327068689

Subjects:
Primary: 03D28

Rights: Copyright © 2012 Association for Symbolic Logic

JOURNAL ARTICLE
12 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.77 • No. 1 • March 2012
Back to Top