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

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

2009-06-21

arxiv.org/abs/0906.3882v1

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hindman's Theorem: An Ultrafilter Argument in Second Order Arithmetic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hindman's Theorem: An Ultrafilter Argument in Second Order Arithmetic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hindman's Theorem: An Ultrafilter Argument in Second Order Arithmetic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-505955