1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.apal.2014.04.002
DC FieldValue
dc.titleA reducibility related to being hyperimmune-free
dc.contributor.authorStephan, F.
dc.contributor.authorYu, L.
dc.date.accessioned2014-10-28T02:29:12Z
dc.date.available2014-10-28T02:29:12Z
dc.date.issued2014
dc.identifier.citationStephan, F., Yu, L. (2014). A reducibility related to being hyperimmune-free. Annals of Pure and Applied Logic 165 (7-8) : 1291-1300. ScholarBank@NUS Repository. https://doi.org/10.1016/j.apal.2014.04.002
dc.identifier.issn01680072
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/102744
dc.description.abstractThe main topic of the present work is the relation that a set X is strongly hyperimmune-free relative to Y. Here X is strongly hyperimmune-free relative to Y if and only if for every partial X-recursive function p there is a partial Y-recursive function q such that every a in the domain of p is also in the domain of q and satisfies p(a)
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.apal.2014.04.002
dc.sourceScopus
dc.subjectHyperimmune
dc.subjectMajorisation
dc.subjectRecursion theory
dc.subjectReducibilities
dc.subjectTuring degrees
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1016/j.apal.2014.04.002
dc.description.sourcetitleAnnals of Pure and Applied Logic
dc.description.volume165
dc.description.issue7-8
dc.description.page1291-1300
dc.description.codenAPALD
dc.identifier.isiut000337204300003
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.