BIRS Workshop Lecture Videos
Computable analysis and reverse mathematics Yokoyama, Keita
Many results of computable analysis can be reunderstood in the setting of reverse mathematics. For example, if there exists a computable instance of a problem whose solution always computes a PA degree, then one can almost say that the statement implies WKL over RCA_0. However, there sometimes exists a non-trivial gap to interpret computable analysis results into reverse mathematics because of the lack of induction. In this talk, I will show such examples and introduce several ways to overcome those obstructions. This is a joint work with Andre Nies and Marcus Triplett.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International