Multiplicative-additive proof equivalence is \textsf{logspace}-complete, via binary decision trees (Q4596799)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiplicative-additive proof equivalence is \textsf{logspace}-complete, via binary decision trees |
scientific article; zbMATH DE number 6816941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiplicative-additive proof equivalence is \textsf{logspace}-complete, via binary decision trees |
scientific article; zbMATH DE number 6816941 |
Statements
11 December 2017
0 references
linear logic
0 references
additive connectives
0 references
proofnets
0 references
proof equivalence
0 references
logarithmic space
0 references
0.9047749638557434
0 references
0.8304557204246521
0 references
0.8091014623641968
0 references
0.8032604455947876
0 references
0.8013911247253418
0 references
