Completeness of the Lambek syntactic calculus
Fundamentalʹnaâ i prikladnaâ matematika, Tome 5 (1999) no. 1, pp. 193-219
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/}
}
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/