Theoretical Computer Science
Bilinear logic in algebra and linguistics
Proceedings of the workshop on Advances in linear logic
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Lambek Grammars Based on Pregroups
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Exploring Feature Agreement in French with Parallel Pregroup Computations
Journal of Logic, Language and Information
Hi-index | 0.00 |
Grammar can be formulated as a kind of substructural propositional logic. In support of this claim, we survey bare Gentzen style deductive systems and two kinds of non-commutative linear logic: intuitionistic and compact bilinear logic. We also glance at their categorical refinements.