Reverse mathematics and infinite traceable graphs

Details Reverse mathematics and infinite traceable graphs Reverse mathematics and infinite traceable graphs

2010-08-26

arxiv.org/abs/1008.4548v2

Mathematics

Logic

Scientific paper

This paper falls within the general program of investigating the proof theoretic strength (in terms of reverse mathematics) of combinatorial principals which follow from versions of Ramsey's theorem. We examine two statements in graph theory and one statement in lattice theory proved by Galvin, Rival and Sands \cite{GRS:82} using Ramsey's theorem for 4-tuples. Our main results are that the statements concerning graph theory are equivalent to Ramsey's theorem for 4-tuples over $\RCA$ while the statement concerning lattices is provable in $\RCA$. Revised 12/2010. To appear in Archive for Mathematical Logic

Affiliated with

Also associated with

No associations

Rating

Reverse mathematics and infinite traceable graphs 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 Reverse mathematics and infinite traceable graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reverse mathematics and infinite traceable graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704275