A modular and parameterized presentation of pregroup calculus

Authors:
Annie Foret
Affiliations:
IRISA -- Rennes 1, Avenue du Général Leclerc, 35042 Rennes Cedex, France
Venue:
Information and Computation
Year:
2010

Citing 5
Cited 0

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
Category theoretical semantics for pregroup grammars

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

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.