Elementary explicit types and polynomial time operations

@article{Spescha2009ElementaryET,
  title={Elementary explicit types and polynomial time operations},
  author={Daria Spescha and Thomas Strahm},
  journal={Math. Log. Q.},
  year={2009},
  volume={55},
  pages={245-258}
}
This paper studies systems of explicit mathematics as introduced by Feferman [9, 11]. In particular, we propose weak explicit type systems with a restricted form of elementary comprehension whose provably terminating operations coincide with the functions on binary words that are computable in polynomial time. The systems considered are natural extensions of the first-order applicative theories introduced in Strahm [19, 20]. 
8 Citations
21 References
Similar Papers

References

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

Recursion theory and set theory: a marriage of convenience

  • S. Feferman
  • Eds., vol. 94 of Stud. Logic Found. Math. North…
  • 1977
Highly Influential
6 Excerpts

A language and axioms for explicit mathematics

  • S. Feferman
  • In Algebra and logic,
  • 1975
Highly Influential
4 Excerpts

Explicit mathematics with positive existential comprehension and join. Master’s thesis, Institut für Informatik und angewandte Mathematik, Universität Bern

  • J. Krähenbühl
  • 2006
2 Excerpts

Similar Papers

Loading similar papers…