The computational complexity of propositional cirquent calculus (Q5246717)
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 6428621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of propositional cirquent calculus |
scientific article; zbMATH DE number 6428621 |
Statements
The Computational Complexity of Propositional Cirquent Calculus (English)
0 references
22 April 2015
0 references
cirquent calculus
0 references
computability logic
0 references
resource semantics
0 references
proof theory
0 references
substructural logics
0 references
0.8915327191352844
0 references
0 references
0.8082196116447449
0 references
0.8005379438400269
0 references
0.7880624532699585
0 references
