Journal of Symbolic Logic

Low level nondefinability results: Domination and recursive enumeration

Mingzhong Cai and Richard A. Shore

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We study low level nondefinability in the Turing degrees. We prove a variety of results, including, for example, that being array nonrecursive is not definable by a $\Sigma_{1}$ or $\Pi_{1}$ formula in the language $(\leq ,\REA)$ where $\REA$ stands for the ``r.e.\ in and above'' predicate. In contrast, this property is definable by a $\Pi_{2}$ formula in this language. We also show that the $\Sigma_{1}$-theory of $(\mathcal{D},\leq ,\REA)$ is decidable.

Article information

J. Symbolic Logic, Volume 78, Issue 3 (2013), 1005-1024.

First available in Project Euclid: 6 January 2014

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 03D28: Other Turing degree structures


Cai, Mingzhong; Shore, Richard A. Low level nondefinability results: Domination and recursive enumeration. J. Symbolic Logic 78 (2013), no. 3, 1005--1024. doi:10.2178/jsl.7803180.

Export citation