Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing

DOI10.1007/978-3-662-47709-0_5zbMath1365.03039OpenAlexW1419998034MaRDI QIDQ2947459

Roberto Maieli, V. Michele Abrusci

Publication date: 24 September 2015

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47709-0_5

zbMATH Keywords

sequent calculusLambek calculuslinear logicproof netscategorial grammarscyclic ordersnon-commutative logiclanguage parsing

Mathematics Subject Classification ID

Logic of natural languages (03B65) Logic in computer science (03B70) Natural language processing (68T50) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (2)

Proof nets for multiplicative cyclic linear logic and Lambek calculus ⋮ Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The Mathematics of Sentence Structure
• Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
• Proof Nets for Lambek Calculus
• A semantic characterisation of the correctness of a proof net
• Proof nets for unit-free multiplicative-additive linear logic

This page was built for publication: Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing