A geometrical procedure for computing relaxation

DOI10.1016/j.apal.2008.10.008zbMath1160.03040OpenAlexW2006757127MaRDI QIDQ1011756

Gabriele Pulcini

Publication date: 9 April 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.10.008

zbMATH Keywords

noncommutative linear logicpermutative logic

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar and braided proof-nets for multiplicative linear logic with mix
• Non-commutative logic. I: The multiplicative fragment
• Implicit exchange in multiplicative proofnets
• Quantales and (noncommutative) linear logic
• Permutative Additives and Exponentials
• Two-dimensional proof-structures and the exchange rule
• Computer Science Logic

This page was built for publication: A geometrical procedure for computing relaxation