Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.apal.2012.11.008
DC FieldValue
dc.titleHighness, locally noncappability and nonboundings
dc.contributor.authorStephan, F.
dc.contributor.authorWu, G.
dc.date.accessioned2014-10-28T02:36:24Z
dc.date.available2014-10-28T02:36:24Z
dc.date.issued2013-05
dc.identifier.citationStephan, 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.issn01680072
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/103374
dc.description.abstractIn 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.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.apal.2012.11.008
dc.sourceScopus
dc.subjectLocally noncappable degrees
dc.subjectNonboundings
dc.subjectRecursively enumerable degrees
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1016/j.apal.2012.11.008
dc.description.sourcetitleAnnals of Pure and Applied Logic
dc.description.volume164
dc.description.issue5
dc.description.page511-522
dc.description.codenAPALD
dc.identifier.isiut000316587600002
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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