Open Access
2014 Independence, Relative Randomness, and PA Degrees
Adam R. Day, Jan Reimann
Notre Dame J. Formal Logic 55(1): 1-10 (2014). DOI: 10.1215/00294527-2377842

Abstract

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 Δ20-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 PTA, then APT'.

Citation

Download Citation

Adam R. Day. Jan Reimann. "Independence, Relative Randomness, and PA Degrees." Notre Dame J. Formal Logic 55 (1) 1 - 10, 2014. https://doi.org/10.1215/00294527-2377842

Information

Published: 2014
First available in Project Euclid: 20 January 2014

zbMATH: 1332.03010
MathSciNet: MR3161408
Digital Object Identifier: 10.1215/00294527-2377842

Subjects:
Primary: 03D32

Keywords: algorithmic randomness , c.e. sets , independence , PA degrees , van Lambalgen’s theorem

Rights: Copyright © 2014 University of Notre Dame

Vol.55 • No. 1 • 2014
Back to Top