- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A Simple Proof and Some Difficult Examples for Hindman's Theorem
Notre Dame Journal of Formal Logic 53 (1):53-65 (2012)
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 TheoremOther Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
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.
A recursive coloring function without $ \pi _3^0$ solutions for hindman’s theorem.Yuke Liao - forthcoming - Journal of Symbolic Logic:1-24.
A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem.Lorenzo Carlucci - 2018 - Archive for Mathematical Logic 57 (3-4):381-389.
Hindman’s theorem for sums along the full binary tree, $$\Sigma ^0_2$$ Σ 2 0 -induction and the Pigeonhole principle for trees. [REVIEW]Lorenzo Carlucci & Daniele Tavernelli - 2022 - Archive for Mathematical Logic 61 (5):827-839.
Ramsey algebras and the existence of idempotent ultrafilters.Wen Chean Teh - 2016 - Archive for Mathematical Logic 55 (3-4):475-491.
Hindman’s theorem in the hierarchy of choice principles.David Fernández-Bretón - 2023 - Journal of Mathematical Logic 24 (1).
Hindman’s theorem, ultrafilters, and reverse mathematics.Jeffry L. Hirst - 2004 - Journal of Symbolic Logic 69 (1):65-72.
Regressive versions of Hindman’s theorem.Lorenzo Carlucci & Leonardo Mainardi - 2024 - Archive for Mathematical Logic 63 (3):447-472.
Analytics
Added to PP
2012-05-10
Downloads
38 (#584,724)
6 months
17 (#166,136)
2012-05-10
Downloads
38 (#584,724)
6 months
17 (#166,136)
Historical graph of downloads
Citations of this work
On the strength of two recurrence theorems.Adam R. Day - 2016 - Journal of Symbolic Logic 81 (4):1357-1374.
References found in this work
Hindman's theorem: An ultrafilter argument in second order arithmetic.Henry Towsner - 2011 - Journal of Symbolic Logic 76 (1):353 - 360.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-f8568656d-t7p9b uwo