Infinite subsets of random sets of integers
From MaRDI portal
Publication:1012969
DOI10.4310/MRL.2009.v16.n1.a10zbMath1179.03061arXiv1408.2881MaRDI QIDQ1012969
Publication date: 28 April 2009
Published in: Mathematical Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2881
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Algorithmic randomness and dimension (03D32)
Related Items (19)
Energy randomness ⋮ Extracting randomness within a subset is hard ⋮ On zeros of Martin-Löf random Brownian motion ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Schnorr randomness for noncomputable measures ⋮ Ramsey-type graph coloring and diagonal non-computability ⋮ Fixed point theorems on partial randomness ⋮ Martin-Löf random generalized Poisson processes ⋮ The coding power of a product of partitions ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ Effectively closed sets of measures and randomness ⋮ Members of Random Closed Sets ⋮ Fixed Point Theorems on Partial Randomness ⋮ A STRONG LAW OF COMPUTATIONALLY WEAK SUBSETS ⋮ Martin-Löf randomness and Galton-Watson processes ⋮ Cohesive avoidance and strong reductions ⋮ Cone avoiding closed sets ⋮ Computable Measure Theory and Algorithmic Randomness
This page was built for publication: Infinite subsets of random sets of integers
