Hindman's theorem: An ultrafilter argument in second order arithmetic

Journal of Symbolic Logic 76 (1):353 - 360 (2011)
  Copy   BIBTEX

Abstract

Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated into second order arithmetic

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1294171005

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

External links

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

Through your library

My notes

Similar books and articles

Hindman’s theorem, ultrafilters, and reverse mathematics.Jeffry L. Hirst - 2004 - Journal of Symbolic Logic 69 (1):65-72.
Arrow's theorem, ultrafilters, and reverse mathematics.Benedict Eastaugh - forthcoming - Review of Symbolic Logic.
A Simple Proof and Some Difficult Examples for Hindman's Theorem.Henry Towsner - 2012 - Notre Dame Journal of Formal Logic 53 (1):53-65.
A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem.Lorenzo Carlucci - 2018 - Archive for Mathematical Logic 57 (3-4):381-389.
Ramsey algebras and the existence of idempotent ultrafilters.Wen Chean Teh - 2016 - Archive for Mathematical Logic 55 (3-4):475-491.
On Formalization of Model-Theoretic Proofs of Gödel's Theorems.Makoto Kikuchi & Kazuyuki Tanaka - 1994 - Notre Dame Journal of Formal Logic 35 (3):403-412.
Nonstandard second-order arithmetic and Riemannʼs mapping theorem.Yoshihiro Horihata & Keita Yokoyama - 2014 - Annals of Pure and Applied Logic 165 (2):520-551.
Mathematical logic.Heinz-Dieter Ebbinghaus - 1996 - New York: Springer. Edited by Jörg Flum & Wolfgang Thomas.
Categoricity, Open-Ended Schemas and Peano Arithmetic.Adrian Ludușan - 2015 - Logos and Episteme 6 (3):313-332.
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.

Analytics

Added to PP
2013-09-30

Downloads
22 (#166,999)

6 months
2 (#1,816,284)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Ultrafilters in reverse mathematics.Henry Towsner - 2014 - Journal of Mathematical Logic 14 (1):1450001.
A Simple Proof and Some Difficult Examples for Hindman's Theorem.Henry Towsner - 2012 - Notre Dame Journal of Formal Logic 53 (1):53-65.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
An effective proof that open sets are Ramsey.Jeremy Avigad - 1998 - Archive for Mathematical Logic 37 (4):235-240.

Add more references