Reverse mathematics and infinite traceable graphs
Peter A. Cholak, David Galvin, Reed Solomon · Mathematical logic quarterly · 2012
Abstract We analyze three applications of Ramsey’s Theorem for 4‐tuples to infinite traceable graphs and finitely generated infinite lattices using the tools of reverse mathematics. The applications in graph theory are shown to be equivalent to Ramsey’s Theorem while the application in lattice theory is shown to be provable in the weaker system RCA0.