Correctness of linear logic proof structures is NL-complete (Q534703): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092553770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Depth Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of multiplicatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The additive multiboxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4896506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsing MELL proof nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof nets for unit-free multiplicative-additive linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: New problems complete for nondeterministic log space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4650584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast verification of MLL proof nets via IMLL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815544 / rank
 
Normal rank

Latest revision as of 01:28, 4 July 2024

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