Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing
From MaRDI portal
Publication:2835043
DOI10.1007/978-3-662-53042-9_3zbMath1478.03081MaRDI QIDQ2835043
Roberto Maieli, V. Michele Abrusci
Publication date: 1 December 2016
Published in: Formal Grammar (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53042-9_3
03B65: Logic of natural languages
03F52: Proof-theoretic aspects of linear logic and other substructural logics
Related Items
Cites Work
- Unnamed Item
- The logic of categorial grammars. A deductive account of natural language syntax and semantics
- Linear logic
- The structure of multiplicatives
- A new correctness criterion for multiplicative non-commutative proof nets
- Classical conservative extensions of Lambek calculus
- Proof nets for the multimodal Lambek calculus
- Non-commutative logic. I: The multiplicative fragment
- Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing
- The Mathematics of Sentence Structure
- Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
- Construction of Retractile Proof Structures
- Proof nets for unit-free multiplicative-additive linear logic