We investigate the question "To what extent can random reals be used as a tool to establish number theoretic facts?" Let 2-RAN be the principle that for every real X there is a real R which is 2-random relative to X. In Section 2, we observe that the arguments of Csima and Mileti [3] can be implemented in the base theory RCA(0) and so RCA(0) + 2-RAN implies the Rainbow Ramsey Theorem. In Section 3, we show that the Rainbow Ramsey Theorem is not conservative over RCA(0) for arithmetic sentences. Thus, from the Csima-Mileti fact that the existence of random reals has infinitary-combinatorial consequences we can conclude that 2-RAN has non-trivial arithmetic consequences. In Section 4, we show that 2-RAN is conservative over RCA(0) + B Sigma(2) for Pi broken vertical bar-sentences. Thus, the set of first-order consequences of 2-RAN is strictly stronger than P- + I Sigma(1) and no stronger than P- + B Sigma(2).
机构:
Univ Paris Est Creteil Val Demarne, Lab Algorithm Complex & Log, Creteil, FranceUniv Paris Est Creteil Val Demarne, Lab Algorithm Complex & Log, Creteil, France
LE Houerou, Quentin
Patey, Ludovic levy
论文数: 0引用数: 0
h-index: 0
机构:
Univ Paris Cite, Inst Math Jussieu Paris Rive Gauche, Equipe Log, CNRS, Campus Grands Moulins, Paris, FranceUniv Paris Est Creteil Val Demarne, Lab Algorithm Complex & Log, Creteil, France
Patey, Ludovic levy
Yokoyama, Keita
论文数: 0引用数: 0
h-index: 0
机构:
Tohoku Univ, Math Inst, Sendai, JapanUniv Paris Est Creteil Val Demarne, Lab Algorithm Complex & Log, Creteil, France
机构:
Univ Paris Est Creteil Val De Marne, Lab Algorithm Complexite & Log, Creteil, FranceUniv Paris Est Creteil Val De Marne, Lab Algorithm Complexite & Log, Creteil, France
LE Houerou, Quentin
Patey, Ludovic Levy
论文数: 0引用数: 0
h-index: 0
机构:
Univ Paris Cite, CNRS, Equipe Log, Inst Math Jussieu Paris Rive Gauche, Campus Grands Moulins, Paris, FranceUniv Paris Est Creteil Val De Marne, Lab Algorithm Complexite & Log, Creteil, France