Completeness of the Lambek syntactic calculus
Fundamentalʹnaâ i prikladnaâ matematika, Tome 5 (1999) no. 1, pp. 193-219
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In this paper we prove that the Lambek syntactic calculus is complete with respect to free semigroup models, i. e. it derives exactly all identities concerning multiplication, left division, and right division of formal languages.
@article{FPM_1999_5_1_a11,
     author = {M. R. Pentus},
     title = {Completeness of the {Lambek} syntactic calculus},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {193--219},
     year = {1999},
     volume = {5},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_1999_5_1_a11/}
}
TY  - JOUR
AU  - M. R. Pentus
TI  - Completeness of the Lambek syntactic calculus
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 1999
SP  - 193
EP  - 219
VL  - 5
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/FPM_1999_5_1_a11/
LA  - ru
ID  - FPM_1999_5_1_a11
ER  - 
%0 Journal Article
%A M. R. Pentus
%T Completeness of the Lambek syntactic calculus
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 1999
%P 193-219
%V 5
%N 1
%U http://geodesic.mathdoc.fr/item/FPM_1999_5_1_a11/
%G ru
%F FPM_1999_5_1_a11
M. R. Pentus. Completeness of the Lambek syntactic calculus. Fundamentalʹnaâ i prikladnaâ matematika, Tome 5 (1999) no. 1, pp. 193-219. http://geodesic.mathdoc.fr/item/FPM_1999_5_1_a11/