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 3, 2012 10:45, Moscow, Steklov Mathematical Institute
 


Deskolemization, equality and logical complexity

Daniel Weller

Vienna University of Technology
Video records:
Flash Video 1,830.4 Mb
Flash Video 301.1 Mb

Number of views:
This page:461
Video files:75

Daniel Weller
Photo Gallery


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

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

Abstract: Skolemization is a well-known method to eliminate one type of quantifier from formulas and (cut-free) proofs. We are interested in questions about proof complexity (in the sense of logical complexity, i.e. the number of sequents in a proof): how much shorter can a proof of the Skolemization of F be when compared to proofs of F? We will show that in the presence of the equality schema, there exists an arbitrary speed-up. The result is proved using techniques from the generalization of proofs.

Language: English

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