On the computational complexity of cut-reduction (Q636310): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:20, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of cut-reduction |
scientific article |
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
