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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03F52 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03F07 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5886382 / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity classes
Property / zbMATH Keywords: complexity classes / rank
 
Normal rank
Property / zbMATH Keywords
 
correctness criteria
Property / zbMATH Keywords: correctness criteria / rank
 
Normal rank
Property / zbMATH Keywords
 
linear logic
Property / zbMATH Keywords: linear logic / rank
 
Normal rank
Property / zbMATH Keywords
 
nondeterministic logspace
Property / zbMATH Keywords: nondeterministic logspace / rank
 
Normal rank

Revision as of 09:44, 1 July 2023

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