arXiv Analytics

Sign in

arXiv:0906.3882 [math.LO]AbstractReferencesReviewsResources

Hindman's Theorem: An Ultrafilter Argument in Second Order Arithmetic

Henry Towsner

Published 2009-06-21Version 1

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: math.LO, math.CO
Related articles: Most relevant | Search more
arXiv:1701.06095 [math.LO] (Published 2017-01-21)
New bounds on the strength of some restrictions of Hindman's Theorem
arXiv:math/9602203 [math.LO] (Published 1996-02-13)
Lebesgue numbers and Atsuji spaces in subsystems of second order arithmetic
arXiv:1606.04194 [math.LO] (Published 2016-06-14)
Cut-elimination for SBL

Links

Toolbox