Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.apal.2014.04.002
Title: A reducibility related to being hyperimmune-free
Authors: Stephan, F. 
Yu, L.
Keywords: Hyperimmune
Majorisation
Recursion theory
Reducibilities
Turing degrees
Issue Date: 2014
Citation: Stephan, 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
Abstract: The 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)
Source Title: Annals of Pure and Applied Logic
URI: http://scholarbank.nus.edu.sg/handle/10635/102744
ISSN: 01680072
DOI: 10.1016/j.apal.2014.04.002
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

1
checked on Dec 12, 2018

WEB OF SCIENCETM
Citations

1
checked on Dec 12, 2018

Page view(s)

54
checked on Dec 7, 2018

Google ScholarTM

Check

Altmetric


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