Algorithmic randomness, reverse mathematics, and the dominated convergence theorem

DOI10.1016/j.apal.2012.05.010zbMath1259.03021arXiv1106.0775OpenAlexW2059834295MaRDI QIDQ714719

Edward T. Dean, Jeremy Avigad, Jason Rute

Publication date: 11 October 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.0775

zbMATH Keywords

measurereverse mathematicsWKLalgorithmic randomnessLebesgue integrationrainbow RamseyWWKLdominated convergence\(G\)-delta2-RAN

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Algorithmic randomness and dimension (03D32)

Related Items (13)

Measure theory and higher order arithmetic ⋮ On the uniform computational content of the Baire category theorem ⋮ Program extraction for 2-random reals ⋮ Splittings and disjunctions in reverse mathematics ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ Where pigeonhole principles meet Koenig lemmas ⋮ On uniform relationships between combinatorial problems ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ On the computability of perfect subsets of sets with positive measure ⋮ The strength of compactness in computability theory and nonstandard analysis ⋮ Computable Measure Theory and Algorithmic Randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
• Riesz representation theorem, Borel measures and subsystems of second- order arithmetic
• Computability on the probability measures on the Borel sets of the unit interval
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Statistical properties of dynamical systems -- Simulation and abstract computation
• Measure theory and weak König's lemma
• Computable randomness and betting for computable probability spaces
• Lowness notions, measure and domination
• A computational aspect of the Lebesgue differentiation theorem
• Algorithmic Randomness and Complexity
• Uniform almost everywhere domination
• Randomness and differentiability
• An Application of Martin-Löf Randomness to Effective Probability Theory
• The strength of the rainbow Ramsey Theorem
• Mass Problems and Measure-Theoretic Regularity
• Lebesgue Convergence Theorems and Reverse Mathematics

This page was built for publication: Algorithmic randomness, reverse mathematics, and the dominated convergence theorem