A Graph-Theoretic Characterization Theorem for Multiplicative Fragment of Non-Commutative Linear Logic (Extended Abstract)

Misao Nagayama, Mitsuhiro Okada

Research output: Contribution to journalArticle

6 Citations (Scopus)


It is well-known that every proof net of a non-commutative version of MLL (Multiplicative fragment of Commutative Linear Logic) can be drawn as a plane Danos-Regnier graph (drawing) satisfying the switching condition of Danos-Regnier [3]. In this paper, we study the reverse direction; we introduce a system MNCLL logically equivalent to the multiplicative fragment of Cyclic Linear Logic introduced by Yetter [9], and show that any plane Danos-Regnier graph drawing satisfying the switching condition represents a unique non-commutative proof net (i.e., a proof net of MNCLL) modulo cyclic shifts. In the course of proving this, we also give the characterization of the non-commutative proof nets by means of the notion of strong planity, as well as the notion of a certain long-trip condition, called the stack-condition, of a Danos-Regnier graph, the latter of which is related to Abrusci balanced long-trip condition [2].

Original languageEnglish
Pages (from-to)153
Number of pages1
JournalElectronic Notes in Theoretical Computer Science
Issue numberC
Publication statusPublished - 1996


ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science (miscellaneous)

Cite this