RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
Video Library
Archive
Most viewed videos

Search
RSS
New in collection





You may need the following programs to see the files






International workshop "Logical Models of Reasoning and Computation"
February 1, 2012 17:30, Moscow, Steklov Mathematical Institute
 


Types and truth in weak applicative theories

Thomas Strahm

University of Bern
Video records:
Flash Video 1,836.5 Mb
Flash Video 302.0 Mb
MP4 302.0 Mb

Number of views:
This page:274
Video files:100

Thomas Strahm
Photo Gallery


Видео не загружается в Ваш браузер:
  1. Установите Adobe Flash Player    

  2. Проверьте с Вашим администратором, что из Вашей сети разрешены исходящие соединения на порт 8080
  3. Сообщите администратору портала о данной ошибке

Abstract: In this talk we survey recent developments in the study of prooftheoretically weak systems of Feferman's explicit mathematics and theories of truth. We start off from pure first-order applicative theories based on a version of untyped combinatory logic and augment them by the typing and naming discipline of explicit mathematics or, alternatively, by a truth predicate in the sense of Frege structures. We discuss the proof-theoretic strength of the so-obtained formalisms and the general relationship between weak truth theories and explicit mathematics. In particular, we consider two truth theories TPR and TPT of primitive recursive and feasible strength. The latter theory is a novel abstract truth-theoretic setting which is able to interpret expressive feasible subsystems of explicit mathematics, bounded arithmetical systems, and unfoldings of feasible arithmetic.
(Joint work with Sebastian Eberhard.)

Language: English

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017