Please use this identifier to cite or link to this item:
Title: Highness, locally noncappability and nonboundings
Authors: Stephan, F. 
Wu, G.
Keywords: Locally noncappable degrees
Recursively enumerable degrees
Issue Date: May-2013
Citation: Stephan, F., Wu, G. (2013-05). Highness, locally noncappability and nonboundings. Annals of Pure and Applied Logic 164 (5) : 511-522. ScholarBank@NUS Repository.
Abstract: In this paper, we improve a result of Seetapun and prove that above any nonzero, incomplete recursively enumerable (r.e.) degree a, there is a high2 r.e. degree c>a witnessing that a is locally noncappable (Theorem 1.1). Theorem 1.1 provides a scheme of obtaining high2 nonboundings (Theorem 1.6), as all known high2 nonboundings, such as high2 degrees bounding no minimal pairs, high2 plus-cuppings, etc. © 2012 Elsevier B.V..
Source Title: Annals of Pure and Applied Logic
ISSN: 01680072
DOI: 10.1016/j.apal.2012.11.008
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Mar 14, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.