Author:
Barmpalias George,Lewis Andrew E. M.,Soskova Mariya
Abstract
AbstractWe say that A ≤LRB if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on γ. In other words, B is at least as good as A for this purpose. We study the structure of the LR degrees globally and locally (i.e., restricted to the computably enumerable degrees) and their relationship with the Turing degrees. Among other results we show that whenever ∝ is not GL2 the LR degree of ∝ bounds degrees (so that, in particular, there exist LR degrees with uncountably many predecessors) and we give sample results which demonstrate how various techniques from the theory of the c.e. degrees can be used to prove results about the c.e. LR degrees.
Publisher
Cambridge University Press (CUP)
Reference22 articles.
1. Binns Stephen , Kjos-Hanssen Bjørn , Miller Joseph S. , and Solomon Reed , Lowness notions, measure and domination, in preparation.
2. A Cappable Almost Everywhere Dominating Computably Enumerable Degree
3. Measure, Π 1 0 -classes and complete extensions of PA
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献