Reverse mathematics and infinite traceable graphs

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.

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[2]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[3]  I. Rival,et al.  A Ramsey-type theorem for traceable graphs☆ , 1982 .

[4]  Stephen G. Simpson,et al.  Subsystems of second order arithmetic , 1999, Perspectives in mathematical logic.

[5]  Petr Hájek,et al.  Metamathematics of First-Order Arithmetic , 1993, Perspectives in mathematical logic.