Polynomial time operations in explicit mathematics
Work
Year: 1997
Type: article
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-applicati... more
Source: Journal of Symbolic Logic
Author Thomas Strahm
Institution University of Bern
Cites: 24
Cited by: 13
Related to: 10
FWCI: 0.89
Citation percentile (by year/subfield): 70.4
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green