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

DOI10.2178/JSL/1174668390zbMATH Open1121.03083OpenAlexW2045129779MaRDI QIDQ3426569FDOQ3426569

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

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

Mathematics Subject Classification ID

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

Cites Work

• Theoretical computer science. Petri nets.
• Title not available (Why is that?)

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)