On the computational complexity of cut-elimination in linear logic. (Q5897348)
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: On the computational complexity of cut-elimination in linear logic. |
scientific article; zbMATH DE number 5674144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of cut-elimination in linear logic. |
scientific article; zbMATH DE number 5674144 |
Statements
Theoretical Computer Science (English)
0 references
23 February 2010
0 references
0.8198886513710022
0 references
0.813849925994873
0 references
0.8131040930747986
0 references
0.8017380833625793
0 references
