Correctness of linear logic proof structures is NL-complete (Q534703): Difference between revisions
From MaRDI portal
Latest revision as of 00: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
10 May 2011
0 references
complexity classes
0 references
correctness criteria
0 references
linear logic
0 references
nondeterministic logspace
0 references