Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.apal.2012.11.008
DC Field | Value | |
---|---|---|
dc.title | Highness, locally noncappability and nonboundings | |
dc.contributor.author | Stephan, F. | |
dc.contributor.author | Wu, G. | |
dc.date.accessioned | 2014-10-28T02:36:24Z | |
dc.date.available | 2014-10-28T02:36:24Z | |
dc.date.issued | 2013-05 | |
dc.identifier.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. https://doi.org/10.1016/j.apal.2012.11.008 | |
dc.identifier.issn | 01680072 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/103374 | |
dc.description.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.. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.apal.2012.11.008 | |
dc.source | Scopus | |
dc.subject | Locally noncappable degrees | |
dc.subject | Nonboundings | |
dc.subject | Recursively enumerable degrees | |
dc.type | Article | |
dc.contributor.department | MATHEMATICS | |
dc.description.doi | 10.1016/j.apal.2012.11.008 | |
dc.description.sourcetitle | Annals of Pure and Applied Logic | |
dc.description.volume | 164 | |
dc.description.issue | 5 | |
dc.description.page | 511-522 | |
dc.description.coden | APALD | |
dc.identifier.isiut | 000316587600002 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.