Planar and braided proof-nets for multiplicative linear logic with mix

DOI10.1007/S001530050101zbMath0905.03037OpenAlexW2073924651MaRDI QIDQ1267841

A. Fleury, Gianluigi Bellin

Publication date: 2 February 1999

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050101

zbMATH Keywords

correctnessplanar graphsCW-complexescut-elimination theorembraided proof-netsexplicit exchange rulemultiplicative linear logic with Mixnoncommutative proof-netsplanar proof-netsprojections under regular isotopy

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07)

Related Items (5)

On the \(\pi\)-calculus and linear logic ⋮ On proof normalization in linear logic ⋮ Sequent reconstruction in LLM -- A sweepline proof ⋮ A quantum double construction in Rel ⋮ A geometrical procedure for computing relaxation

This page was built for publication: Planar and braided proof-nets for multiplicative linear logic with mix