| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 426514 | Information and Computation | 2010 | 11 Pages |
Abstract
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 calculi. The cut elimination property and the decidability property of the sequent calculus proposed in the article are shown. Properties of composed calculi are also discussed.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
