Proof nets for the Lambekcalculus — an overview (1996)
by
François Lamarche
,
Christian Retoré
| Venue: | Proceedings of the Third Roma Workshop ”Proofs and Linguistic Categories |
| Citations: | 13 - 2 self |
BibTeX
@INPROCEEDINGS{Lamarche96proofnets,
author = {François Lamarche and Christian Retoré},
title = {Proof nets for the Lambekcalculus — an overview},
booktitle = {Proceedings of the Third Roma Workshop ”Proofs and Linguistic Categories},
year = {1996},
pages = {241--262}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
1 Introduction: the interest of proof nets for categorial grammar There are both linguistic and mathematical reasons for studying proof nets the perspective of categorial grammar. It is now well known that the Lambek calculus corresponds to intuitionnistic non-commutative multiplicative linear logic — with no empty antecedent, to be absolutely precise. As natural deduction underlines the constructive contents of intuitionistic
