Lambek Grammars Based on Pregroups
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
An Algebraic Approach to French Sentence Structure
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
An Algebraic Analysis of Clitic Pronouns in Italian
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
A Framework for Developing Embeddable Customized Logics
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Mathematical Structures in Computer Science
Category theoretical semantics for pregroup grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
On categorial grammars as logical information systems
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
| Hi-index | 0.00 |
The concept of pregroup was introduced by Lambek for natural language analysis, with a close link to non-commutative linear logic. We reformulate the pregroup calculus so as to extend it by composition with other logics and calculii. The cut elimination property and the decidability property of the sequent calculus proposed in the article are shown. Properties of composed calculii are also discussed.