Computability Learning Seminar

Tuesday, March 31, 2015 3:30 pm - 3:30 pm EDT (GMT -04:00)

Sam Eisenstat, Department of Pure Mathematics, University of Waterloo

“Ramsey’s Theorem in Reverse Mathematics”

We look at the logical strengths of a number of different forms of Ramsey’s Theorem. We will see that ACA0 proves all of the forms of Ramsey’s Theorem that we study. We will also use the results about WKL0 that we saw last time to show that WKL0 does not prove even the relatively weak RT2. Finally, we will see that RT23 proves ACA0 over RCA0.

MC 5413