Journal of Symbolic Logic

Polynomial Time Operations in Explicit Mathematics

Thomas Strahm

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

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 $\mathbb{W} = \{0, 1\}^\ast$ are exactly the polynomial time computable functions. Our treatment of PTO is proof-theoretic and very much in the spirit of reductive proof theory.

Article information

Source
J. Symbolic Logic, Volume 62, Issue 2 (1997), 575-594.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183745243

Mathematical Reviews number (MathSciNet)
MR1464114

Zentralblatt MATH identifier
0891.03023

JSTOR
links.jstor.org

Citation

Strahm, Thomas. Polynomial Time Operations in Explicit Mathematics. J. Symbolic Logic 62 (1997), no. 2, 575--594. https://projecteuclid.org/euclid.jsl/1183745243


Export citation