On the computational complexity of cut-reduction (Q636310)
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-reduction |
scientific article; zbMATH DE number 5943615
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of cut-reduction |
scientific article; zbMATH DE number 5943615 |
Statements
On the computational complexity of cut-reduction (English)
0 references
26 August 2011
0 references
cut-elimination
0 references
notation systems
0 references
bounded arithmetic
0 references
definable functions
0 references
