University of Connecticut

Events Calendar

Connecticut Logic Seminar
The reverse mathematics of a theorem involving perfect matchings of countable graphs
Matt Jura (Manhattan College)

Monday, March 25, 2019
4:45pm – 6:00pm

Storrs Campus
MONT 214

In 1977, K. Steffens proved a theorem which gives a necessary and sufficient condition for a countable graph to have a perfect matching (we have named this "Steffens' Theorem"). We investigate the proof-theoretic strength of a number of variations of Steffens' Theorem in the context of reverse mathematics. In this talk, we will encounter each of the "Big Five" subsystems, and more. This work is joint with Stephen Flood, Oscar Levin, and Tyler Markkanen.

Contact:

Reed Solomon, david.solomon@uconn.edu

Connecticut Logic Seminar (primary), UConn Master Calendar

Control Panel