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






Workshop on Proof Theory, Modal Logic and Reflection Principles
October 18, 2017 15:35, Moscow, Steklov Mathematical Institute
 


On the computational aspects of Kripke's theory of truth

S. Speranski
Video records:
MP4 884.0 Mb
MP4 242.3 Mb

Number of views:
This page:88
Video files:59

S. Speranski


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

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

Abstract: We shall discuss how to measure complexity of partial truth predicates arising in Kripke's theory of truth. Аpart from giving a survey of the topic, I shall present a method for proving complexity results in this direction, and show how to use it to obtain some interesting generalisations of known results. This method will be both relatively simple, involving only the basic machinery of constructive ordinals, and rather general.

Language: English

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