A new correctness criterion for the proof nets of non-commutative multiplicative linear logics (Q4328819)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1735279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new correctness criterion for the proof nets of non-commutative multiplicative linear logics |
scientific article; zbMATH DE number 1735279 |
Statements
A new correctness criterion for the proof nets of non-commutative multiplicative linear logics (English)
0 references
8 October 2002
0 references
computational complexity
0 references
correctness criterion
0 references
marked Danos-Reginer graphs
0 references
Multiplicative Cyclic Linear Logic
0 references
non-commutative Linear Logic
0 references
algorithm for the correctness checking of proof nets
0 references
0.96954316
0 references
0.9142457
0 references
0.9077774
0 references
0.90496653
0 references
0.89661425
0 references
0.8935722
0 references
