Skip to main content
SpringerLink
Log in

Restrictions of Hindman’s Theorem: An Overview

  • Conference paper
  • First Online:
Connecting with Computability (CiE 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12813))

Included in the following conference series:

Abstract

I give a short overview on bounds on the logical strength and effective content of restrictions of Hindman’s Theorem based on the family of sums for which monochromaticity is required, highlighting a number of questions I find interesting.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Anglès-D’Auriac, P.E.: Infinite Computations in Algorithmic Randomness and Reverse Mathematics. Université Paris-Est. Ph.D. Thesis (2020)

    Google Scholar 

  2. Blass, A.: Some questions arising from Hindman’s theorem. Scientiae Mathematicae Japonicae 62, 331–334 (2005)

    MathSciNet  MATH  Google Scholar 

  3. Blass, A.R., Hirst, J.L., Simpson, S.G.: Logical analysis of some theorems of combinatorics and topological dynamics. In: Logic and Combinatorics. Contemporary Mathematics, vol. 65, pp. 125–156. American Mathematical Society, Providence, RI (1987)

    Google Scholar 

  4. Carlucci, L.: A weak variant of Hindman’s theorem stronger than Hilbert’s theorem. Arch. Math. Logic 57, 381–389 (2018)

    Article  MathSciNet  Google Scholar 

  5. Carlucci, L.: Weak yet strong restrictions of Hindman’s finite sums theorem. Proc. Am. Math. Soc. 146, 819–829 (2018)

    Article  MathSciNet  Google Scholar 

  6. Carlucci, L., Kołodziejczyk, L.A., Lepore, F., Zdanowski, K.: New bounds on the strength of some restrictions of Hindman’s theorem. Computability 9, 139–153 (2020)

    Article  MathSciNet  Google Scholar 

  7. Carlucci, L., Tavernelli, D.: Hindman’s theorem for sums along the full binary tree, \(\varSigma ^0_2\)-induction and the Pigeonhole Principle for trees. Accepted for publication in Archive for Mathematical Logic

    Google Scholar 

  8. Carlucci, L., Zdanowski, K.: The strength of Ramsey’s theorem for coloring relatively large sets. J. Symb. Logic 79(1), 89–102 (2014)

    Article  MathSciNet  Google Scholar 

  9. Csima, B.F., Dzhafarov, D.D., Hirschfeldt, D.R., Jockusch, C.G., Jr., Solomon, R., Westrick, L.B.: The reverse mathematics of Hindman’s theorem for sums of exactly two elements. Computability 8, 253–263 (2019)

    Article  MathSciNet  Google Scholar 

  10. Dorais, F.G., Dzhafarov, D., Hirst, J.L., Mileti, J.P., Paul, P.S.: On uniform relationships between combinatorial problems. Trans. Am. Math. Soc. 368(2), 1321–1359 (2016)

    Article  MathSciNet  Google Scholar 

  11. Dzhafarov, D.D., Hirst, J.L.: The polarized Ramsey’s theorem. Arch. Math. Logic 48(2), 141–157 (2011)

    Article  MathSciNet  Google Scholar 

  12. Dzhafarov, D.D., Jockusch, C.G., Solomon, R., Westrick, L.B.: Effectiveness of Hindman’s theorem for bounded sums. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds.) Computability and Complexity. LNCS, vol. 10010, pp. 134–142. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-50062-1_11

    Chapter  Google Scholar 

  13. Hindman, N.: The existence of certain ultrafilters on \(N\) and a conjecture of Graham and Rothschild. Proc. Am. Math. Soc. 36(2), 341–346 (1972)

    MathSciNet  MATH  Google Scholar 

  14. Hindman, N.: Finite sums from sequences within cells of a partition of N. J. Comb. Theor. Ser. A 17, 1–11 (1974)

    Article  MathSciNet  Google Scholar 

  15. Hindman, N., Leader, I., Strauss, D.: Open problems in partition regularity. Comb. Probab. Comput. 12, 571–583 (2003)

    Article  MathSciNet  Google Scholar 

  16. Hirst, J.: Hilbert vs Hindman. Arch. Math. Logic 51(1–2), 123–125 (2012)

    Article  MathSciNet  Google Scholar 

  17. Hirst, J.L.: Disguising induction: proofs of the pigeonhole principle for trees. Found. Adventures Tribut. 22, 113–123 (2014). College Publications, London

    Google Scholar 

  18. Mohsenipour, S., Shelah, S.: On finitary Hindman numbers. Combinatorica 39(5), 1185–1189 (2019). https://doi.org/10.1007/s00493-019-4002-7

    Article  MathSciNet  MATH  Google Scholar 

  19. Montalbán, A.: Open questions in reverse mathematics. Bull. Symb. Logic 17(3), 431–454 (2011)

    Article  MathSciNet  Google Scholar 

  20. Simpson, S.: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge University Press, Cambridge. Association for Symbolic Logic, New York (2009)

    Google Scholar 

  21. Tavernelli, D.: On the strength of restrictions of Hindman’s theorem. MSc. Thesis, Sapienza University of Roma (2018)

    Google Scholar 

  22. Beiglböck, M., Towsner, H.: Transfinite approximation of Hindman’s theorem. Isr. J. Math. 191, 41–59 (2012)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Sapienza University, Rome, Italy

    Lorenzo Carlucci

Authors
  1. Lorenzo Carlucci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lorenzo Carlucci .

Editor information

Editors and Affiliations

  1. University of Lille, Lille, France

    Liesbeth De Mol

  2. Vakgroep Wiskunde, Ghent University, Ghent, Belgium

    Andreas Weiermann

  3. University of Göttingen, Göttingen, Germany

    Florin Manea

  4. Ghent University, Ghent, Belgium

    David Fernández-Duque

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Carlucci, L. (2021). Restrictions of Hindman’s Theorem: An Overview. In: De Mol, L., Weiermann, A., Manea, F., Fernández-Duque, D. (eds) Connecting with Computability. CiE 2021. Lecture Notes in Computer Science(), vol 12813. Springer, Cham. https://doi.org/10.1007/978-3-030-80049-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-80049-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-80048-2

  • Online ISBN: 978-3-030-80049-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation