## Notre Dame Journal of Formal Logic

### Stable Ramsey's Theorem and Measure

Damir D. Dzhafarov

#### Abstract

The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are nonnull in a certain effective measure-theoretic sense. We show that the sets that can compute infinite homogeneous sets for nonnull many computable stable colorings and the sets that can compute infinite homogeneous sets for all computable stable colorings agree below $\emptyset'$ but not in general. We also answer the analogs of two well-known questions about the stable Ramsey's theorem by showing that our weaker principle does not imply COH or WKL0 in the context of reverse mathematics.

#### Article information

Source
Notre Dame J. Formal Logic, Volume 52, Number 1 (2011), 95-112.

Dates
First available in Project Euclid: 13 December 2010

https://projecteuclid.org/euclid.ndjfl/1292249613

Digital Object Identifier
doi:10.1215/00294527-2010-039

Mathematical Reviews number (MathSciNet)
MR2747165

Zentralblatt MATH identifier
1217.03019

#### Citation

Dzhafarov, Damir D. Stable Ramsey's Theorem and Measure. Notre Dame J. Formal Logic 52 (2011), no. 1, 95--112. doi:10.1215/00294527-2010-039. https://projecteuclid.org/euclid.ndjfl/1292249613

#### References

• [1] Ambos-Spies, K., B. Kjos-Hanssen, S. Lempp, and T. A. Slaman, "Comparing DNR" and WWKL, The Journal of Symbolic Logic, vol. 69 (2004), pp. 1089--1104.
• [2] Binns, S., and S. G. Simpson, "Embeddings into the Medvedev and Muchnik lattices of $\Pi^0_1$" classes, Archive for Mathematical Logic, vol. 43 (2004), pp. 399--414.
• [3] Cholak, P. A., C. G. Jockusch, and T. A. Slaman, "On the strength of Ramsey's theorem for pairs", The Journal of Symbolic Logic, vol. 66 (2001), pp. 1--55.
• [4] Downey, R., D. R. Hirschfeldt, S. Lempp, and R. Solomon, "A $\Delta^0_2$" set with no infinite low subset in either it or its complement, The Journal of Symbolic Logic, vol. 66 (2001), pp. 1371--81.
• [5] Downey, R., D. R. Hirschfeldt, J. S. Miller, and A. Nies, "Relativizing Chaitin's halting probability", Journal of Mathematical Logic, vol. 5 (2005), pp. 167--92.
• [6] Downey, R. G., and D. R. Hirschfeldt, Algorithmic Randomness and Complexity, Theory and Applications of Computability. Springer-Verlag, Berlin, 2010.
• [7] Dzhafarov, D. D., Reverse Mathematics of Combinatorial Principles, Ph.D. thesis, University of Chicago. In preparation.
• [8] Hirschfeldt, D. R., C. G. Jockusch, Jr., B. Kjos-Hanssen, S. Lempp, and T. A. Slaman, "The strength of some combinatorial principles related to Ramsey's theorem for pairs", pp. 143--61 in Computational Prospects of Infinity. Part II. Presented Talks, edited by C. Chong et al., vol. 15 of Lecture Notes Series. Institute for Mathematical Sciences. National University of Singapore, World Scientific Publishing, Hackensack, 2008.
• [9] Hirschfeldt, D. R., and S. A. Terwijn, "Limit computability and constructive measure", pp. 131--41 in Computational Prospects of Infinity. Part II. Presented Talks, edited by C. Chong et al., vol. 15 of Lecture Notes Series. Institute for Mathematical Sciences. National University of Singapore, World Scientific Publishing, Hackensack, 2008.
• [10] Jockusch, C., and F. Stephan, "A cohesive set which is not high", Mathematical Logic Quarterly, vol. 39 (1993), pp. 515--30.
• [11] Jockusch, C. G., Jr., "Ramsey's theorem and recursion theory", The Journal of Symbolic Logic, vol. 37 (1972), pp. 268--80.
• [12] Jockusch, C. G., Jr., "Degrees of functions with no fixed points", pp. 191--201 in Logic, Methodology and Philosophy of Science, VIII (Moscow, 1987), vol. 126 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1989.
• [13] Kjos-Hanssen, B., "A strong law of computationally weak subsets", Preprint. http://eccc.hpi-web.de/report/2010/150/.
• [14] Kjos-Hanssen, B., Section 7 of Computability, Reverse Mathematics, and Combinatorics: Open Problems, Banff International Research Station (BIRS), Alberta, 2009. http://www.birs.ca/events/2008/5-day-workshops/08w5019.
• [15] Kučera, A., "Measure, $\Pi^0_1$"-classes and complete extensions of ${\rm PA}$, pp. 245--59 in Recursion Theory Week (Oberwolfach, 1984), vol. 1141 of Lecture Notes in Mathematics, Springer, Berlin, 1985.
• [16] Mileti, J. R., Partition Theorems and Computability Theory, Ph.D. thesis, University of Illinois at Urbana-Champaign, 2004.
• [17] Schnorr, C.-P., Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie, vol. 218 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1971.
• [18] Simpson, S. G., "Degrees of unsolvability: A survey of results", pp. 631--52 in Handbook of Mathematical Logic, edited by J. Barwise, vol. 90 of Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1977.
• [19] Simpson, S. G., Subsystems of Second Order Arithmetic, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1999.
• [20] Soare, R. I., Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987.
• [21] Stephan, F., "Marin-Löf random and PA"-complete sets, pp. 342--48 in Logic Colloquium '02, vol. 27 of Lecture Notes in Logic, Association for Symbolic Logic, La Jolla, 2006.
• [22] Terwijn, S. A., Computability and Measure, Ph.D. thesis, Institute for Logic, Language, and Computation, Amsterdam, 1998.
• [23] Terwijn, S. A., "On the quantitative structure of $\Delta_2^0$", pp. 271--83 in Reuniting the Antipodes---Constructive and Nonstandard Views of the Continuum (Venice, 1999), vol. 306 of Synthese Library, Kluwer Academic Publishers, Dordrecht, 2001.
• [24] Yu, X., and S. G. Simpson, "Measure theory and weak König's lemma", Archive for Mathematical Logic, vol. 30 (1990), pp. 171--80.