Polynomial time operations in explicit mathematics-Reference-Cited by-同舟云学术

Polynomial time operations in explicit mathematics

Published:1997-06 Issue:2 Volume:62 Page:575-594
ISSN:0022-4812
Container-title:Journal of Symbolic Logic
language:en
Short-container-title:J. symb. log.

Author:

Strahm Thomas

Abstract

AbstractIn 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.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference26 articles.

1. [24] Strahm T. , Theories with self-application of strength PRA, Master's thesis , Institut für Informatik und angewandte Mathematik, Universität Bern, 1992.

2. [23] Seth A. , Complexity theory of higher type functionals, Ph.D. thesis , Tata Institute of Fundamental Research, Bombay, 1994.

3. Recursion-Theoretic Hierarchies

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Applicative theories for the polynomial hierarchy of time and its levels;Annals of Pure and Applied Logic;2013-06

2. An applicative theory for FPH;Electronic Proceedings in Theoretical Computer Science;2011-01-27

3. Elementary explicit types and polynomial time operations;Mathematical Logic Quarterly;2009-05-15

4. Theories with self-application and computational complexity;Information and Computation;2003-09

5. Polytime, combinatory logic and positive safe induction;Archive for Mathematical Logic;2002-02-01