Feasible Operations and Applicative Theories Based on lambda-eta

@article{Cantini2000FeasibleOA,
  title={Feasible Operations and Applicative Theories Based on lambda-eta},
  author={Andrea Cantini},
  journal={Math. Log. Q.},
  year={2000},
  volume={46},
  pages={291-312}
}
We study a theory PTO(λη) of polynomial time computability on the type of binary strings (in the style of [6]), as embedded in full lambda calculus with total application and extensionality. We prove that the closed terms of (provable) type W −→ W are exactly the polynomial time operations. This answers a conjecture of Strahm [13]. Mathematics Subject Classification: 03F30, 03F50, 03B40. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
7 Extracted Citations
13 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-7 of 7 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 13 references

Polynomial time computable arithmetic. In: Logic and Computation (W

  • F. Ferreira
  • Sieg, ed.), Contemporary Mathematics,
  • 1990
Highly Influential
7 Excerpts

Applikative Theorien und Frege-Strukturen

  • R. Kahle
  • Ph. D. Thesis, IAM,
  • 1997

Notes on provability of Church-Rosser property in weak theories

  • D. Pianigiani
  • Preprint , Firenze
  • 1997
2 Excerpts

On the proof theory of applicative theories

  • T. Strahm
  • Ph. D. Thesis, IAM,
  • 1996

A note on polynomial time computable arithmetic

  • W. Buchholz, W. Sieg
  • Logic and Computation, Contemporary Mathematics,
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…