Hostname: page-component-7dd5485656-c8zdz Total loading time: 0 Render date: 2025-10-29T11:17:04.036Z Has data issue: false hasContentIssue false
  • English
  • Français

THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS

Part of: Proof theory and constructive mathematics General logic Computability and recursion theory

Published online by Cambridge University Press:  24 November 2021

LU LIU Open the ORCID record for LU LIU [Opens in a new window]  and
LUDOVIC PATEY Open the ORCID record for LUDOVIC PATEY [Opens in a new window]
LU LIU
Affiliation:
SCHOOL OF MATHEMATICS AND STATISTICS HNP-LAMA, CENTRAL SOUTH UNIVERSITY CHANGSHA 410083, PEOPLE’S REPUBLIC OF CHINA E-mail: g.jiayi.liu@gmail.com
LUDOVIC PATEY
Affiliation:
CNRS, INSTITUT CAMILLE JORDAN UNIVERSITÉ CLAUDE BERNARD LYON 1 43 BOULEVARD DU 11 NOVEMBRE 1918 F-69622 VILLEURBANNE CEDEX, FRANCE E-mail: ludovic.patey@computability.fr
Get access Rights & Permissions [Opens in a new window]

Abstract

The thin set theorem for n-tuples and k colors ($\operatorname {\mathrm {\sf {TS}}}^n_k$) states that every k-coloring of $[\mathbb {N}]^n$ admits an infinite set of integers H such that $[H]^n$ avoids at least one color. In this paper, we study the combinatorial weakness of the thin set theorem in reverse mathematics by proving neither $\operatorname {\mathrm {\sf {TS}}}^n_k$, nor the free set theorem ($\operatorname {\mathrm {\sf {FS}}}^n$) imply the Erdős–Moser theorem ($\operatorname {\mathrm {\sf {EM}}}$) whenever k is sufficiently large (answering a question of Patey and giving a partial result towards a question of Cholak Giusto, Hirst and Jockusch). Given a problem $\mathsf {P}$, a computable instance of $\mathsf {P}$ is universal iff its solution computes a solution of any other computable $\mathsf {P}$-instance. It has been established that most of Ramsey-type problems do not have a universal instance, but the case of Erdős–Moser theorem remained open so far. We prove that Erdős–Moser theorem does not admit a universal instance (answering a question of Patey).

Keywords

computability theoryreverse mathematicsErdős–Moser theoremthin set theoremfree set theorem

MSC classification

Primary: 03D80: Applications of computability and recursion theory
Secondary: 03F35: Second- and higher-order arithmetic and fragments 03B30: Foundations of classical theories (including reverse mathematics)

Information

Type
Article
Information
The Journal of Symbolic Logic , Volume 87 , Issue 1 , March 2022 , pp. 313 - 346
Check for updates
Copyright
© The Author(s), 2021. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Bovykin, A. and Weiermann, A., The strength of infinitary Ramseyan principles can be accessed by their densities. Annals of Pure and Applied Logic, vol. 169 (2005), no. 9, pp. 1700–1709.Google Scholar
Cholak, P., Giusto, M., Hirst, J., and Jockusch, C. Jr, Free sets and reverse mathematics, Reverse Mathematics 2001 (Ross, S. G., editor), Lecture Notes in Logic, vol. 21, A. K. Peters/CRC Press, Boca Raton, FL, pp. 104–119.Google Scholar
Friedman, H. M., Some systems of second order arithmetic and their use. Proceedings of the International Congress of Mathematicians (James, R. D., editor), Canadian Mathematical Society, Montreal, Quebec, 1974, pp. 235–242.Google Scholar
Friedman, H. M.. Fom:53:free sets and reverse math and fom:54:recursion theory and dynamics. Available at https://www.cs.nyu.edu/pipermail/fom/.Google Scholar
Hirschfeldt, D. R. and Shore, R. A., Combinatorial principles weaker than Ramsey’s theorem for pairs, this Journal, vol. 72 (2007), no. 1, pp. 171–206.Google Scholar
Jockusch, C. G., Ramsey’s theorem and recursion theory, this Journal, vol. 37 (1972), no. 2, pp. 268–280.Google Scholar
Jockusch, C. G. and Soare, R. I., ${\varPi}_1^0$ classes and degrees of theories. Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33–56.Google Scholar
Lerman, M., Solomon, R., and Towsner, H., Separating principles below Ramsey’s theorem for pairs. Journal of Mathematical Logic, vol. 13 (2013), no. 02, p. 1350007.CrossRefGoogle Scholar
Liu, L., RT ${{}_2^2\ \, }$ does not imply WKL ${}_0$ , this Journal, vol. 77 (2012), no. 2, pp. 609–620.Google Scholar
Liu, L., Cone avoiding closed sets. Transactions of the American Mathematical Society, vol. 367 (2015), no. 3, pp. 1609–1630.CrossRefGoogle Scholar
Montalbán, A., Open questions in reverse mathematics. Bulletin of Symbolic Logic, vol. 17 (2011), no. 03, pp. 431–454.CrossRefGoogle Scholar
Odifreddi, P., Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers. Elsevier, Amsterdam, 1992.Google Scholar
Patey, L., Combinatorial weaknesses of Ramseyan principles. In preparation. Available at http://ludovicpatey.com/media/research/combinatorial-weaknesses-draft.pdf, 2015.Google Scholar
Patey, L., Degrees bounding principles and universal instances in reverse mathematics. Annals of Pure and Applied Logic, vol. 166 (2015), no. 11, pp. 1165–1185.CrossRefGoogle Scholar
Patey, L., Open questions about Ramsey-type statements in reverse mathematics. Bulletin of Symbolic Logic, vol. 22 (2016), no. 2, pp. 151–169.Google Scholar
Patey, L., Partial orders and immunity in reverse mathematics. Conference on Computability in Europe, Springer, Berlin, 2016, pp. 353–363.Google Scholar
Patey, L., The reverse mathematics of Ramsey-type theorems . Ph.D. thesis, Université Paris Diderot, 2016.Google Scholar
Patey, L., The weakness of being cohesive, thin or free in reverse mathematics. Israel Journal of Mathematics, vol. 216 (2016), no. 2, pp. 905–955.CrossRefGoogle Scholar
Seetapun, D. and Slaman, T. A., On the strength of Ramsey’s theorem. Notre Dame Journal of Formal Logic, vol. 36 (1995), no. 4, pp. 570–582.CrossRefGoogle Scholar
Simpson, S. G., Subsystems of Second Order Arithmetic, Cambridge University Press, Cambridge, 2009.CrossRefGoogle Scholar
Wang, W., Some logically weak Ramseyan theorems. Advances in Mathematics, vol. 261 (2014), pp. 1–25.CrossRefGoogle Scholar