Hostname: page-component-77c89778f8-cnmwb Total loading time: 0 Render date: 2024-07-21T10:19:39.423Z Has data issue: false hasContentIssue false
  • English
  • Français

Reverse mathematics and a Ramsey-type König's Lemma

Published online by Cambridge University Press:  12 March 2014

Stephen Flood
Stephen Flood*
Affiliation:
Department of Mathematics, University of Notre Dame, 255 Hurley Hall, Notre Dame, IN 46556, USA, E-mail: sflood@nd.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we propose a weak regularity principle which is similar to both weak König's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then analyze different ways of generalizing this principle.

Keywords

Ramsey's theoremweak König's lemmareverse mathematics
Type
Research Article
Information
The Journal of Symbolic Logic , Volume 77 , Issue 4 , December 2012 , pp. 1272 - 1280
Copyright
Copyright © Association for Symbolic Logic 2012

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.)

References

REFERENCES

[1]Cholak, Peter A., Jockusch, Carl G. Jr., and Slaman, Theodore A., On the strength of Ramsey's theorem for pairs, this Journal, vol. 66 (2001), no. 1, pp. 1–55.Google Scholar
[2]Cholak, Peter A., Corrigendum to: “On the strength of Ramsey's theorem for pairs”, this Journal, vol. 74 (2009), no. 4, pp. 1438–1439.Google Scholar
[3]Chong, C. T., personal communication, 2012.Google Scholar
[4]Chong, C. T., Lempp, Steffen, and Yang, Yue, On the role of the collection principle for -formulas in second-order reverse mathematics, Proceedings of the American Mathematical Society, vol. 138 (2010), no. 3, pp. 1093–1100.CrossRefGoogle Scholar
[5]Downey, Rod, Hirschfeldt, Denis R., Lempp, Steffen, and Solomon, Reed, A set with no infinite low subset in either it or its complement, this Journal, vol. 66 (2001), no. 3, pp. 1371–1381.Google Scholar
[6]Downey, Rod and Jockusch, Carl G. Jr., Effective presentability of Boolean algebras of Cantor-Bendixson rank 1, this Journal, vol. 64 (1999), no. 1, pp. 45–52.Google Scholar
[7]Dzhafarov, Damir D., Stable Ramsey's theorem and measure, Notre Dame Journal of Formal Logic, vol. 52 (2011), no. 1, pp. 95–112.CrossRefGoogle Scholar
[8]Hirschfeldt, Denis R., Jockusch, Carl G. Jr., Kjos-Hanssen, Bjørn, Lempp, Steffen, and Slaman, Theodore A., The strength of some combinatorial principles related to Ramsey's theorem for pairs, Computational prospects of infinity. Part II. Presented talks, Lecture Notes Series. Institute for Mathematical Sciences, National University of Singapore, vol. 15, World Scientific Publishing, Hackensack, NJ, 2008, pp. 143–161.CrossRefGoogle Scholar
[9]Jockusch, Carl and Stephan, Frank, A cohesive set which is not high, Mathematical Logic Quarterly, vol. 39 (1993), no. 4, pp. 515–530.CrossRefGoogle Scholar
[10]Jockusch, Carl G. Jr., classes and Boolean combinations of recursively enumerable sets, this Journal, vol. 39 (1974), pp. 95–96.Google Scholar
[11]Liu, Jiayi, does not imply WKL, this Journal, vol. 77 (2012), pp. 609–620.Google ScholarPubMed
[12]Seetapun, David and Slaman, Theodore A., On the strength of Ramsey's theorem, Notre Dame Journal of Formal Logic, vol. 36 (1995), no. 4, pp. 570–582, Special Issue: Models of arithmetic.CrossRefGoogle Scholar
[13]Simpson, Stephen G., Subsystems of second order arithmetic, 2 ed., Perspectives in Logic, Cambridge University Press, Cambridge, 2009.CrossRefGoogle Scholar
[14]Soare, Robert I., Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987.CrossRefGoogle Scholar
[15]Yokoyama, Keita, personal communication, 2011.Google Scholar