Author:
Cooper S. Barry,Li Angsheng
Abstract
AbstractIt is shown that there exists a low2 Harrington non-splitting base — that is, a low2 computably enumerable (c.e.) degree a such that for any c.e. degrees x, y, if 0′ = x ∨ y, then either 0′ = x ∨ a or 0′ = y ∨ a. Contrary to prior expectations, the standard Harrington non-splitting construction is incompatible with the low2-ness requirements to be satisfied, and the proof given involves new techniques with potentially wider application.
Publisher
Cambridge University Press (CUP)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献