A new correctness criterion for the proof nets of non-commutative multiplicative linear logics

DOI10.2307/2694960zbMath0994.03051OpenAlexW2048460490MaRDI 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

zbMATH Keywords

computational complexitycorrectness criterionalgorithm for the correctness checking of proof netsmarked Danos-Reginer graphsMultiplicative Cyclic Linear Logicnon-commutative Linear Logic

Mathematics Subject Classification ID

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

Related Items (1)

A linear algorithm for MLL proof net correctness and sequentialization

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• The structure of multiplicatives
• The Mathematics of Sentence Structure
• Proof Nets for Lambek Calculus

This page was built for publication: A new correctness criterion for the proof nets of non-commutative multiplicative linear logics