Weihrauch reducibility and Ramsey theorems
University of Connecticut
Weihrauch reducibility is a common tool in computable analysis for understanding and comparing the computational content of theorems. In recent years, variations of Weihrauch reducibility have been used to study Ramsey type theorems in the context of reverse mathematics where they give a finer analysis than implications in RCA0 and they allow comparisons of computably true principles. In this talk, we will give examples of recent results and techniques in this area.
Reed Solomon is a Professor in the Department of Mathematics at the University of Connecticut, studying computability theory. He received his doctorate from Cornell University in 1998, under the supervision of Richard Shore, and subsequently held postdoctoral positions at the University of Wisconsin and Notre Dame University.