|Time:|| 12 - 1:20 p.m.
Department of Philosophy
Carnegie Mellon University
|Title:||General logical metatheorems for functional analysis||
|Abstract:||In recent years, the so-called program of "proof mining" has received increased attention. "Proof mining" is the extraction of additional information, such as uniformities or computable bounds, from (formal) proofs in mathematics using proof-theoretic techniques. This program goes back to Kreisel's "unwinding program" in the 1960s but has been rejuvenated by the work of primarily U.Kohlenbach since the 1990s. We will present some of the most recent general metatheorems for proof mining in abstract functional analysis. These results are joint work with U.Kohlenbach.|