Journal article 1137 views
On the computational complexity of cut-reduction
Annals of Pure and Applied Logic, Volume: 161, Issue: 6, Pages: 711 - 736
Swansea University Author:
Arnold Beckmann
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1016/j.apal.2009.06.004
Abstract
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all the known results on definable functions of certain such theo...
| Published in: | Annals of Pure and Applied Logic |
|---|---|
| ISSN: | 0168-0072 |
| Published: |
Elsevier
2009
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa161 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all the known results on definable functions of certain such theories can be reobtained in a uniform way. |
|---|---|
| College: |
Faculty of Science and Engineering |
| Issue: |
6 |
| Start Page: |
711 |
| End Page: |
736 |