|
This article is cited in 3 scientific papers (total in 3 papers)
An application of proof-nets to the study of fragments of the Lambek calculus
Yu. V. Savateev M. V. Lomonosov Moscow State University
Abstract:
We use proof-nets to study the algorithmic complexity of the derivability
problem for some fragments of the Lambek calculus. We prove the
NP-completeness of this problem for the unidirectional fragment and the
product-free fragment, and also for versions of these fragments that admit
empty antecedents.
Keywords:
Lambek calculus, algorithmic complexity, proof-nets.
Received: 01.06.2009 Revised: 10.11.2010
Citation:
Yu. V. Savateev, “An application of proof-nets to the study of fragments of the Lambek calculus”, Izv. Math., 75:3 (2011), 631–663
Linking options:
https://www.mathnet.ru/eng/im4118https://doi.org/10.1070/IM2011v075n03ABEH002547 https://www.mathnet.ru/eng/im/v75/i3/p189
|
Statistics & downloads: |
Abstract page: | 404 | Russian version PDF: | 187 | English version PDF: | 19 | References: | 44 | First page: | 7 |
|