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

From MaRDI portal
Revision as of 00:19, 4 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1735279
Language Label Description Also known as
English
A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
scientific article; zbMATH DE number 1735279

    Statements

    A new correctness criterion for the proof nets of non-commutative multiplicative linear logics (English)
    0 references
    0 references
    0 references
    0 references
    8 October 2002
    0 references
    0 references
    computational complexity
    0 references
    correctness criterion
    0 references
    marked Danos-Reginer graphs
    0 references
    Multiplicative Cyclic Linear Logic
    0 references
    non-commutative Linear Logic
    0 references
    algorithm for the correctness checking of proof nets
    0 references
    0 references