A Simple Proof and Some Difficult Examples for Hindman's Theorem

Notre Dame Journal of Formal Logic 53 (1):53-65 (2012)
  Copy   BIBTEX


We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several examples of colorings of the integers which do not have computable witnesses to Hindman's Theorem



    Upload a copy of this work     Papers currently archived: 92,991

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Ramsey Algebras and Formal Orderly Terms.Wen Chean Teh - 2017 - Notre Dame Journal of Formal Logic 58 (1):115-125.
Thin Set Versions of Hindman’s Theorem.Denis R. Hirschfeldt & Sarah C. Reitzes - 2022 - Notre Dame Journal of Formal Logic 63 (4):481-491.
Ramsey algebras.Wen Chean Teh - 2016 - Journal of Mathematical Logic 16 (2):1650005.
Ramsey algebras and the existence of idempotent ultrafilters.Wen Chean Teh - 2016 - Archive for Mathematical Logic 55 (3-4):475-491.
Regressive versions of Hindman’s theorem.Lorenzo Carlucci & Leonardo Mainardi - 2024 - Archive for Mathematical Logic 63 (3):447-472.
Hilbert versus Hindman.Jeffry L. Hirst - 2012 - Archive for Mathematical Logic 51 (1-2):123-125.


Added to PP

19 (#824,557)

6 months
6 (#588,740)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the strength of two recurrence theorems.Adam R. Day - 2016 - Journal of Symbolic Logic 81 (4):1357-1374.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.

Add more references