Article contents
Polynomial time operations in explicit mathematics
Published online by Cambridge University Press: 12 March 2014
Abstract
In this paper we study (self-)applicative theories of operations and binary words in the context of polynomial time computability. We propose a first order theory PTO which allows full self-application and whose provably total functions on = {0, 1}* are exactly the polynomial time computable functions. Our treatment of PTO is proof-theoretic and very much in the spirit of reductive proof theory.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1997
References
REFERENCES
- 5
- Cited by