Completeness of MLL proof-nets w.r.t. weak distributivity

DOI10.2178/JSL/1174668390MaRDI QIDQ3426569zbMATH OpenOpenAlexFDO

Authors Jean-Baptiste Joinet

Publication date 12 March 2007

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1174668390

Mathematics Subject Classification ID

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

Recommendations

• No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete
• Proof equivalence in MLL is PSPACE-complete
• Proof nets for unit-free multiplicative-additive linear logic
• Computer Science Logic
• Fast verification of MLL proof nets via IMLL

Cites work

• scientific article; zbMATH DE number 194975 (Why is no real title available?)
• Theoretical computer science. Petri nets.

Cited in

(3)

• A coding theoretic study of MLL proof nets
• Proof equivalence in MLL is PSPACE-complete
• No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete

This page was built for publication: Completeness of MLL proof-nets w.r.t. weak distributivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3426569)