DocumentCode
1995702
Title
Language completeness of the Lambek calculus
Author
Pentus, M.
Author_Institution
Dept. of Math. Logic, Moscow State Univ., Russia
fYear
1994
fDate
4-7 Jul 1994
Firstpage
487
Lastpage
496
Abstract
Proves that the Lambek calculus (J. Lambek, American Math. Monthly, vol. 65, no. 3, pp. 154-170, 1958), which is essentially a subsystem of noncommutative linear logic, is complete with respect to L-models, i.e. free semigroup models
Keywords
formal languages; formal logic; group theory; L-models; Lambek calculus; free semigroup models; language completeness; noncommutative linear logic; Artificial intelligence; Calculus; Logic; Mathematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1994. LICS '94. Proceedings., Symposium on
Conference_Location
Paris
Print_ISBN
0-8186-6310-3
Type
conf
DOI
10.1109/LICS.1994.316042
Filename
316042
Link To Document