Caleb Davis, Jeffry Hirst, Jake Pardo, Timothy Ransom
Published 2018-04-25Version 1
Working in subsystems of second order arithmetic, we formulate several representations for hypergraphs. We then prove the equivalence of various vertex coloring theorems to ${\sf WKL}_0$, ${\sf ACA}_0$ and $\Pi ^1_ 1$-${\sf CA}_0$.
The reverse mathematics of the Thin set and the Erdős-Moser theorems
Partial orders and immunity in reverse mathematics
Splittings and disjunctions in Reverse Mathematics
![QR code for arXiv:1804.09638 [math.LO]](http://oss.arxitics.com/images/favicon.svg)