Polynomial time operations in explicit mathematics

Journal of Symbolic Logic 62 (2):575-594 (1997)
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 W = {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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275547
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,831
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Solomon Feferman (1995). Definedness. Erkenntnis 43 (3):295 - 320.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

69 ( #46,039 of 1,724,852 )

Recent downloads (6 months)

65 ( #16,264 of 1,724,852 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.