## WORKSHOP ON PROOF THEORY AND COMPUTABILITY THEORY 2012## - Philosophical Frontiers in Reverse Mathematics## Harumi Grand Hotel, Tokyo, Japan.## Homepage | Program + Abstracts PDFResponsible for this page: Naohi Eguchi (Mathematical Institute, Tohoku University)
■ Organizing Committe Kazuyuki Tanaka (Tohoku) (chair), Andreas Weiermann (Ghent) (chair), Toshiyasu Arai (Chiba), Naohi Eguchi (Tohoku), Hajime Ishihara (JAIST), Sam Sanders (Ghent) and Takeshi Yamazaki (Tohoku). ■ Speakers##
Categorical Structures of Basic Pairs and Concrete Spaces - Basic Structures for Constructive Topology. [slides] Forcing arguments in second order arithmetic. [slides] Reverse mathematics and some independence results for PA. [slides] Recursive marriage theorems and reverse mathematics. [slides] On the reverse mathematics of Peano categoricity. [slides] Order-theoretic Approaches to Computational Complexity - Towards more natural characterisations. [slides] Bounds on provability in set theories. [slides] Phase transitions for unprovability. [slides] Logical Extraction of Effective Bounds from Proofs in Nonlinear Ergodic Theory. [slides] Some conservative extension results of classical logic over intuitionistic logic. [slides] Effective strong nullness and diminutiveness. [slides] The inner structures of Turing upward closures. [slides] Schnorr Layerwise Computability. [slides] Composition of irreducible algebras by matrix product. Infinite Games and Reverse Mathematics. Propagation of partial randomness. [slides] The ghosts of departed quantities as the soul of computation. [slides] Determinacy and Optimal Strategies of Network Games. [slides] Interpretation between weak theories of concatenation and arithmetic. [slides] Relative Randomness for Martin-L\"{o}f random Sets. [slides] ■ Pictures |