Translator Disclaimer
June 2008 Randomness, lowness and degrees
George Barmpalias, Andrew E. M. Lewis, Mariya Soskova
J. Symbolic Logic 73(2): 559-577 (June 2008). DOI: 10.2178/jsl/1208359060

Abstract

We 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 20 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.

Citation

Download Citation

George Barmpalias. Andrew E. M. Lewis. Mariya Soskova. "Randomness, lowness and degrees." J. Symbolic Logic 73 (2) 559 - 577, June 2008. https://doi.org/10.2178/jsl/1208359060

Information

Published: June 2008
First available in Project Euclid: 16 April 2008

zbMATH: 1145.03020
MathSciNet: MR2414465
Digital Object Identifier: 10.2178/jsl/1208359060

Rights: Copyright © 2008 Association for Symbolic Logic

JOURNAL ARTICLE
19 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.73 • No. 2 • June 2008
Back to Top