Title	Computable analysis and reverse mathematics
Creator	Yokoyama, Keita
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-12-07T10:45
Description	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.
Extent	49 minutes
Subject	Mathematics; Mathematical logic and foundations; Dynamical systems and ergodic theory; Logic and foundations
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: JAIST
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2017-06-09
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0348166
URI	http://hdl.handle.net/2429/61887
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos