Notre Dame Journal of Formal Logic

On the Indecomposability of ωn

Jared R. Corduan and François G. Dorais


We study the reverse mathematics of pigeonhole principles for finite powers of the ordinal ω. Four natural formulations are presented, and their relative strengths are compared. In the analysis of the pigeonhole principle for ω2, we uncover two weak variants of Ramsey’s theorem for pairs.

Article information

Notre Dame J. Formal Logic Volume 53, Number 3 (2012), 373-395.

First available in Project Euclid: 24 September 2012

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 03B30: Foundations of classical theories (including reverse mathematics) [See also 03F35]
Secondary: 03F35: Second- and higher-order arithmetic and fragments [See also 03B30]

reverse mathematics indecomposability partition principles


Corduan, Jared R.; Dorais, François G. On the Indecomposability of $\omega^{n}$. Notre Dame J. Formal Logic 53 (2012), no. 3, 373--395. doi:10.1215/00294527-1716784.

Export citation


  • [1] Cholak, P. A., C. G. Jockusch, and T. A. Slaman, “On the strength of Ramsey’s theorem for pairs,” Journal of Symbolic Logic, vol. 66 (2001), pp. 1–55.
  • [2] Chong, C. T., S. Lempp, and Y. Yang, “On the role of the collection principle for $\Sigma^{0}_{2}$-formulas in second-order reverse mathematics,” Proceedings of the American Mathematical Society, vol. 138 (2010), pp. 1093–1100.
  • [3] Dorais, F. G., “A variant of Mathias forcing that preserves $\mathsf{\mbox{ACA}}_{0}$,” preprint, arXiv:1110.6559v2 [math.LO]
  • [4] Downey, R., D. R. Hirschfeldt, S. Lempp, and R. Solomon, “A $\Delta_{2}^{0}$ set with no infinite low subset in either it or its complement,” Journal of Symbolic Logic, vol. 66 (2001), pp. 1371–1381.
  • [5] Dzhafarov, D. D., and J. L. Hirst, “The polarized Ramsey’s theorem,” Archive for Mathematical Logic, vol. 48 (2009), pp. 141–157.
  • [6] Dzhafarov, D. D., and C. G. Jockusch, “Ramsey’s theorem and cone avoidance,” Journal of Symbolic Logic, vol. 74 (2009), pp. 557–578.
  • [7] Fraïssé, R., Theory of Relations, revised edition, with an appendix by N. Sauer, vol. 145 of Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 2000.
  • [8] Hájek, P., and P. Pudlák, Metamathematics of First-Order Arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1998.
  • [9] Hirschfeldt, D. R., and R. A. Shore, “Combinatorial principles weaker than Ramsey’s theorem for pairs,” Journal of Symbolic Logic, vol. 72 (2007), pp. 171–206.
  • [10] Hirst, J. L., “Reverse mathematics and ordinal exponentiation,” Annals of Pure and Applied Logic, vol. 66 (1994), pp. 1–18.
  • [11] Hirst, J. L., “Combinatorics in subsystems of second order arithmetic,” Ph.D. dissertation, The Pennsylvania State University, ProQuest LLC, Ann Arbor, 1987.
  • [12] Jockusch, C., and F. Stephan, “A cohesive set which is not high,” Mathematical Logic Quarterly, vol. 39 (1993), pp. 515–530.
  • [13] Kohlenbach, U., “Higher order reverse mathematics,” pp. 281–295 in Reverse Mathematics 2001, vol. 21 of Lecture Notes in Logic, Association for Symbolic Logic, La Jolla, California, 2005.
  • [14] Seetapun, D., and T. A. Slaman, “On the strength of Ramsey’s theorem,” Notre Dame Journal of Formal Logic, vol. 36 (1995), pp. 570–582.
  • [15] Simpson, S. G., Subsystems of Second Order Arithmetic, 2nd edition, Perspectives in Logic, Cambridge University Press, Cambridge, 2009.
  • [16] Švejdar, V., “The limit lemma in fragments of arithmetic,” Commentationes Mathematicae Universitatis Carolinae, vol. 44 (2003), pp. 565–568.