An Arithmetic for Non-Size-Increasing Polynomial-Time Computation
Cached
Download Links
- [www.mathematik.uni-muenchen.de]
- [www.loria.fr]
- [www-compsci.swan.ac.uk]
- DBLP
Other Repositories/Bibliography
by
Klaus Aehlig
,
Ulrich Berger
,
Martin Hofmann
,
Helmut Schwichtenberg
| Citations: | 2 - 0 self |
BibTeX
@MISC{Aehlig_anarithmetic,
author = {Klaus Aehlig and Ulrich Berger and Martin Hofmann and Helmut Schwichtenberg},
title = {An Arithmetic for Non-Size-Increasing Polynomial-Time Computation},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Gödel's T and therefore defines a non-size-increasing polynomial time computable function.
