Theoretical Computer Science
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
First-order linear logic without modalities is NEXPTIME-hard
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Proceedings of the workshop on Advances in linear logic
Proceedings of the workshop on Advances in linear logic
Deciding provability of linear logic formulas
Proceedings of the workshop on Advances in linear logic
Handbook of Logic and Language
Handbook of Logic and Language
PROLOG and Natural Language Analysis
PROLOG and Natural Language Analysis
Efficient Resource Management for Linear Logic Proof Search
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
A definite clause version of Categorial Grammar
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Dutch Grammar and Processing: A Case Study in TLG
Logic, Language, and Computation
Journal of Logic, Language and Information
Logical approximation for program analysis
Higher-Order and Symbolic Computation
Controlling extraction in abstract categorial grammars
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
| Hi-index | 0.00 |
In this paper we will discuss the first order multiplicativeintuitionistic fragment of linear logic, MILL1, and itsapplications to linguistics. We give an embedding translation fromformulas in the Lambek Calculus to formulas in MILL1 and show thistranslation is sound and complete. We then exploit the extra power ofthe first order fragment to give an account of a number of linguisticphenomena which have no satisfactory treatment in the Lambek Calculus.