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., 2014, Volume 8222, Pages 268–278 (Mi lncs14)  

$L$-completeness of the Lambek calculus with the reversal operation allowing empty antecedents

S. Kuznetsov

Moscow State University, Russia

Abstract: In this paper we prove that the Lambek calculus allowing empty antecedents and enriched with a unary connective corresponding to language reversal is complete with respect to the class of models on subsets of free monoids ($L$-models).

Funding Agency Grant Number
Russian Foundation for Basic Research 11-01-00281-a
12-01-00888-a
Ministry of Education and Science of the Russian Federation NSh-65648.2010.1
Swiss National Science Foundation STCP-CH-RU, project “Computational Proof Theory”
This research was supported by the Russian Foundation for Basic Research (grants 11-01-00281-a and 12-01-00888-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-54789-8_15


Bibliographic databases:

Language:

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

    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:60

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