Proof nets for multiplicative cyclic linear logic and Lambek calculus

DOI10.1017/S0960129518000300zbMath1456.03092MaRDI QIDQ5377696

V. Michele Abrusci, Roberto Maieli

Publication date: 27 May 2019

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

sequent calculusLambek calculuslinear logicproof netscategorial grammarsnoncommutative logiccyclic orderslanguage parsing

Mathematics Subject Classification ID

Structure of proofs (03F07) 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 (1)

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic

Cites Work

• Unnamed Item
• Unnamed Item
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• A linear algorithm for MLL proof net correctness and sequentialization
• 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-Additive Proof Nets of Linear Logic with an Application to Language Parsing
• Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing
• On the Dependencies of Logical Rules
• The Mathematics of Sentence Structure
• Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
• Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete
• Proof Nets for Lambek Calculus
• Construction of Retractile Proof Structures
• Proof nets for unit-free multiplicative-additive linear logic

This page was built for publication: Proof nets for multiplicative cyclic linear logic and Lambek calculus