An applicative theory for FPH

Reinhard Kahle
(CENTRIA and DM, FCT, Universidade Nova de Lisboa)
Isabel Oitavem
(CMAF, Universidade de Lisboa and DM, FCT, Universidade Nova de Lisboa)

In this paper we introduce an applicative theory which characterizes the polynomial hierarchy of time.

In Steffen van Bakel, Stefano Berardi and Ulrich Berger: Proceedings Third International Workshop on Classical Logic and Computation (CL&C 2010), Brno, Czech Republic, 21-22 August 2010, Electronic Proceedings in Theoretical Computer Science 47, pp. 44–56.
Published: 27th January 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.47.6 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org