A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic

DOI10.1016/S0304-3975(01)00178-5zbMath1029.03054OpenAlexW2063908436MaRDI QIDQ1398479

Misao Nagayama, Mitsuhiro Okada

Publication date: 29 July 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00178-5

zbMATH Keywords

linear logicplanar graphproof netnoncommutative logicDanos-Regnier graph drawingsequentialization theorem

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• The structure of multiplicatives
• The Mathematics of Sentence Structure
• Quantales and (noncommutative) linear logic
• Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
• Proof Nets for Lambek Calculus
• Interpolation in fragments of classical linear logic

This page was built for publication: A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic