Translator Disclaimer
2012 A Simple Proof and Some Difficult Examples for Hindman's Theorem
Henry Towsner
Notre Dame J. Formal Logic 53(1): 53-65 (2012). DOI: 10.1215/00294527-1626518

Abstract

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.

Citation

Download Citation

Henry Towsner. "A Simple Proof and Some Difficult Examples for Hindman's Theorem." Notre Dame J. Formal Logic 53 (1) 53 - 65, 2012. https://doi.org/10.1215/00294527-1626518

Information

Published: 2012
First available in Project Euclid: 9 May 2012

zbMATH: 1253.03033
MathSciNet: MR2925268
Digital Object Identifier: 10.1215/00294527-1626518

Subjects:
Primary: 03F35
Secondary: 05D10

Rights: Copyright © 2012 University of Notre Dame

JOURNAL ARTICLE
13 PAGES


SHARE
Vol.53 • No. 1 • 2012
Back to Top