RANDOMNESS NOTIONS AND REVERSE MATHEMATICS
DOI10.1017/jsl.2019.50zbMath1444.03013arXiv1808.02746OpenAlexW2973179377MaRDI QIDQ5107230
Publication date: 17 April 2020
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.02746
Kolmogorov complexitycomputability theoryreverse mathematicsalgorithmic randomnessSchnorrMartin-Löf2-randombalanced randomC-incompressibilitycomputably randomweak DeMuth random
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Algorithmic randomness and dimension (03D32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effectively approximating measurable sets by open sets
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
- Demuth randomness and computational complexity
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
- Mass problems associated with effectively closed sets
- On the uniform computational content of computability theory
- Limit complexities revisited
- Density, forcing, and the covering problem
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Measure theory and weak König's lemma
- A Survey of Mučnik and Medvedev Degrees
- COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
- Las Vegas Computability and Algorithmic Randomness
- Jump inversions inside effectively closed sets and applications to randomness
- Difference randomness
- Algorithmic Randomness and Complexity
- Mass Problems and Randomness
- Uniform almost everywhere domination
- Randomness and Computability: Open Questions
- Counting the changes of random Δ20 sets
- The strength of the rainbow Ramsey Theorem
- Lebesgue Convergence Theorems and Reverse Mathematics
- On the algebraic structure of Weihrauch degrees
- On the logical strengths of partial solutions to mathematical problems
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation
- THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE
- Every 2-random real is Kolmogorov random
- USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
- A unified approach to the definition of random sequences
- ∏ 0 1 Classes and Degrees of Theories
- Randomness, relativization and Turing degrees
This page was built for publication: RANDOMNESS NOTIONS AND REVERSE MATHEMATICS
