|
This article is cited in 1 scientific paper (total in 1 paper)
$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).
Linking options:
https://www.mathnet.ru/eng/lncs14
|
Statistics & downloads: |
Abstract page: | 89 |
|