Blog Archives
Topic Archive: Weihrauch reducibility
CUNY Logic WorkshopFriday, December 2, 20162:00 pmGC 6417
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.