Abstract
In [6, p. 586] Spector asked whether given a number e there exists a unary partial function from the natural numbers into {0, 1} with coinfinite domain such that for any function ƒ into {0, 1} extending it is the case thatWe answer this question affirmatively in Corollary 1 below and show that can be made partial recursive (p.r.) with recursive domain. The reader who is familiar with Spector's paper [6] will find the new trick that is required in the first paragraph of the proof of Lemma 2 below.From one point of view, this is a theorem about trees which branch twice at every node. We shall formulate a generalization which applies to trees which branch n times at every node.
Publisher
Canadian Mathematical Society
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A DNC function that computes no effectively bi-immune set;Archive for Mathematical Logic;2015-03-06
2. Diagonally Non-Computable Functions and Bi-Immunity;The Journal of Symbolic Logic;2013-09
3. Silver Measurability and its relation to other regularity properties;Mathematical Proceedings of the Cambridge Philosophical Society;2005-01
4. Π11 relations and paths through;Journal of Symbolic Logic;2004-06
5. Minimal degrees which are Σ₂⁰ but not Δ₂⁰;Proceedings of the American Mathematical Society;2003-06-17