Random reals, the rainbow Ramsey theorem, and arithmetic conservation

DOI10.2178/jsl.7801130zbMath1305.03055OpenAlexW2136273143MaRDI QIDQ4916553

Theodore A. Slaman, Chris J. Conidis

Publication date: 23 April 2013

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1358951108

zbMATH Keywords

RCAreverse mathematicsrainbow Ramsey theoremrandom reals2-RANarithmetic conservationC\(\Gamma\)cardinality scheme

Mathematics Subject Classification ID

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

Related Items (8)

The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS ⋮ Program extraction for 2-random reals ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? ⋮ Degrees bounding principles and universal instances in reverse mathematics ⋮ Where pigeonhole principles meet Koenig lemmas ⋮ On uniform relationships between combinatorial problems

Cites Work

• The theory of \(\kappa\)-like models of arithmetic
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• Algorithmic Randomness and Complexity
• Constructing κ-like Models of Arithmetic
• The definition of random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random reals, the rainbow Ramsey theorem, and arithmetic conservation