Correctness of linear logic proof structures is NL-complete (Q534703)

From MaRDI portal
Revision as of 01:28, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Correctness of linear logic proof structures is NL-complete
scientific article

    Statements

    Correctness of linear logic proof structures is NL-complete (English)
    0 references
    0 references
    10 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity classes
    0 references
    correctness criteria
    0 references
    linear logic
    0 references
    nondeterministic logspace
    0 references
    0 references