Title :
Language completeness of the Lambek calculus
Author_Institution :
Dept. of Math. Logic, Moscow State Univ., Russia
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;
Conference_Titel :
Logic in Computer Science, 1994. LICS '94. Proceedings., Symposium on
Conference_Location :
Paris
Print_ISBN :
0-8186-6310-3
DOI :
10.1109/LICS.1994.316042
