Article contents
Hindman's theorem: an ultrafilter argument in second order arithmetic
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2011
References
REFERENCES
- 5
- Cited by