Program extraction for 2-random reals
From MaRDI portal
Publication:365682
DOI10.1007/S00153-013-0336-9zbMATH Open1295.03039OpenAlexW2021119129MaRDI QIDQ365682FDOQ365682
Authors: Alexander P. Kreuzer 
Publication date: 9 September 2013
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-013-0336-9
Recommendations
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation
- Term extraction and Ramsey's theorem for pairs
- \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
- Randomness notions and reverse mathematics
- Proof mining and combinatorics. Program extraction for Ramsey's theorem for pairs
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Functionals in proof theory (03F10)
Cites Work
- Algorithmic randomness and complexity.
- Measure theory and weak König's lemma
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Elimination of Skolem functions for monotone formulas in analysis
- Term extraction and Ramsey's theorem for pairs
- Primitive recursion and the chain antichain principle
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation
- Title not available (Why is that?)
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
Cited In (3)
This page was built for publication: Program extraction for 2-random reals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q365682)
