Abstract
Retraceable sets were denned in Dekker and Myhill [5]. In that paper it was pointed out that if A is a retraceable set, then A is recursive in each of its infinite subsets, i.e. A is introreducible. We would like to know to what extent theorems on retraceable sets also hold for introreducible sets; however, we have made very little progress in this direction. On the other hand, “uniformly introreducible” sets (which will be defined in §2) are more tractable, and it turns out that some results on retraceable sets extend to uniformly introreducible sets while others fail.
Publisher
Cambridge University Press (CUP)
Reference19 articles.
1. Arithmetical Sets and Retracing Functions
2. Retraceable Sets
3. Three theorems on the degrees of recursively enumerable sets
4. Miller W. , Sets of integers and degrees of unsolvability, Master's thesis, University of Washington, Seattle, Wash, 1967.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing sets from all infinite subsets;Transactions of the American Mathematical Society;2021-08-30
2. Effectiveness for the Dual Ramsey Theorem;Notre Dame Journal of Formal Logic;2021-08-01
3. Measuring the complexity of reductions between equivalence relations;Computability;2019-09-20
4. THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH;The Journal of Symbolic Logic;2019-09-10
5. His Second Student;Baltic Journal of Modern Computing;2016-12-19