Hilbert versus Hindman

Archive for Mathematical Logic 51 (1-2):123-125 (2012)

Abstract
We show that a statement HIL, which is motivated by a lemma of Hilbert and close in formulation to Hindman’s theorem, is actually much weaker than Hindman’s theorem. In particular, HIL is finitistically reducible in the sense of Hilbert’s program, while Hindman’s theorem is not
Keywords Reverse mathematics  Pigeonhole  Conservation  Finitism
Categories (categorize this paper)
DOI 10.1007/s00153-011-0257-4
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 38,878
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Hindman's Theorem, Ultrafilters, and Reverse Mathematics.Jeffry L. Hirst - 2004 - Journal of Symbolic Logic 69 (1):65-72.
A Simple Proof and Some Difficult Examples for Hindman's Theorem.Henry Towsner - 2012 - Notre Dame Journal of Formal Logic 53 (1):53-65.
Aspekte der frege–hilbert-korrespondenz.Kai F. Wehmeier - 1997 - History and Philosophy of Logic 18 (4):201-209.
Hilbert's Epistemology.Philip Kitcher - 1976 - Philosophy of Science 43 (1):99-115.

Analytics

Added to PP index
2013-10-27

Total views
7 ( #745,519 of 2,319,027 )

Recent downloads (6 months)
2 ( #571,679 of 2,319,027 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature