Independence, relative randomness, and PA degrees

Adam R. Day, Jan Reimann

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We study pairs of reals that are mutually Martin-Löf random with respect to a common, not necessarily computable probability measure. We show that a generalized version of van Lambalgen's theorem holds for noncomputable probability measures, too. We study, for a given real A, the independence spectrum of A, the set of all B such that there exists a probability measure μ so that μ{A,B} = 0 and {A,B} is {μ × μ}-random. We prove that if A is computably enumerable (c.e.), then no δ0 2-set is in the independence spectrum of A. We obtain applications of this fact to PA degrees. In particular, we show that if A is c.e. and P is of PA degree so that P ≱T A, then A ⊕ P ≥T ; ∅.

Original languageEnglish (US)
Pages (from-to)1-10
Number of pages10
JournalNotre Dame Journal of Formal Logic
Issue number1
StatePublished - 2014

All Science Journal Classification (ASJC) codes

  • Logic


Dive into the research topics of 'Independence, relative randomness, and PA degrees'. Together they form a unique fingerprint.

Cite this