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 15:30, Moscow, Steklov Mathematical Institute
 


Grammars based on variants of the Lambek calculus

Stepan Kuznetsov

Moscow State University
Video records:
Flash Video 1,158.0 Mb
Flash Video 190.3 Mb
MP4 190.3 Mb

Number of views:
This page:371
Video files:102

Stepan Kuznetsov
Photo Gallery


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

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

Abstract: We consider the Lambek calculus with one division and one primitive type (L(p)) and two extensions of the Lambek calculus: L1 (adding the unit constant) and LR (adding a unary connective that corresponds to taking the language of the inverse strings). We prove that L(p)- grammars and LR-grammars generate precisely all context-free languages without the empty word, and L1-grammars generate precisely all context-free languages.

Language: English

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