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].Â