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

DOI

この論文をさがす

説明

<jats:title>Abstract.</jats:title><jats:p>This paper presents a new correctness criterion for marked Danos-Reginer graphs (D-R graphs, for short) of Multiplicative Cyclic Linear Logic MCLL and Abrusci's non-commutative Linear Logic MNLL.</jats:p><jats:p>As a corollary we obtain an affirmative answer to the open question whether a known quadratic-time algorithm for the correctness checking of proof nets for MCLL and MNLL can be improved to linear-time.</jats:p>

収録刊行物

詳細情報 詳細情報について

  • CRID
    1871991017575619456
  • DOI
    10.2307/2694960
  • ISSN
    19435886
    00224812
  • データソース種別
    • OpenAIRE

問題の指摘

ページトップへ