Lecture Notes in Computer Science
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Main page
About this project
Software
Classifications
Links
Terms of Use

Search papers
Search references

RSS
Current issues
Archive issues
What is RSS






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Lecture Notes in Comput. Sci., 2012, Volume 7351, Pages 151–160 (Mi lncs11)  

L-completeness of the Lambek calculus with the reversal operation

S. Kuznetsov

Moscow State University

Abstract: We extend the Lambek calculus with rules for a unary operation corresponding to language reversal and prove that this calculus is complete with respect to the class of models on subsets of free semigroups (L-models). We also prove that categorial grammars based on this calculus generate precisely all context-free languages without the empty word.

Funding Agency Grant Number
Russian Foundation for Basic Research 11-01-00281-a
Ministry of Education and Science of the Russian Federation NSh-65648.2010.1
Swiss Federal Council STCP-CH-RU, project “Computational Proof Theory”
This research was supported by the Russian Foundation for Basic Research (grant 11-01-00281-a), by the Presidential Council for Support of Leading Research Schools (grant NSh-65648.2010.1) and by the Scientific and Technological Cooperation Programme Switzerland–Russia (STCP-CH-RU, project “Computational Proof Theory”).


DOI: https://doi.org/10.1007/978-3-642-31262-5_10


Bibliographic databases:

Language:

Linking options:
  • http://mi.mathnet.ru/eng/lncs11

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Number of views:
    This page:66

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021