A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
From MaRDI portal
Publication:4328819
DOI10.2307/2694960zbMath0994.03051MaRDI QIDQ4328819
Mitsuhiro Okada, Misao Nagayama
Publication date: 8 October 2002
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2694960
computational complexity; correctness criterion; algorithm for the correctness checking of proof nets; marked Danos-Reginer graphs; Multiplicative Cyclic Linear Logic; non-commutative Linear Logic
03F52: Proof-theoretic aspects of linear logic and other substructural logics
Related Items
Cites Work