scientific article; zbMATH DE number 1231525

MaRDI QIDQ4222840zbMATH OpenFDO

Authors Misao Nagayama, Mitsuhiro Okada

Publication date 14 December 1998

Full work available at URL http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume3.htm#nagayama

zbMATH Keywords

Danos-Regnier graphlong-trip conditionmultiplicative fragment of cyclic linear logicnoncommutative proof netswitching condition

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Structure of proofs (03F07)

Recommendations

• A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
• A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
• A new correctness criterion for cyclic proof nets

Cited in

(7)

• Planar and braided proof-nets for multiplicative linear logic with mix
• Handsome proof-nets: Perfect matchings and cographs
• A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
• Proof-search and proof nets in mixed linear logic
• Connection-based proof construction in non-commutative logic
• scientific article; zbMATH DE number 1114352 (Why is no real title available?)
• Logic beyond formulas: a proof system on graphs

This page was built for publication:

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