Publisher: Cambridge University Press
E-ISSN: 1943-5886|62|2|575-594
ISSN: 0022-4812
Source: The Journal of Symbolic Logic, Vol.62, Iss.2, 1997-06, pp. : 575-594
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In 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
Related content
Power types in explicit mathematics?
The Journal of Symbolic Logic, Vol. 62, Iss. 4, 1997-12 ,pp. :
On power set in explicit mathematics
The Journal of Symbolic Logic, Vol. 61, Iss. 2, 1996-06 ,pp. :
Realization of analysis into Explicit Mathematics
The Journal of Symbolic Logic, Vol. 66, Iss. 4, 2001-12 ,pp. :
Uniform inseparability in explicit mathematics
The Journal of Symbolic Logic, Vol. 64, Iss. 1, 1999-03 ,pp. :
Commuting Polynomial Operations of Distributive Lattices
Order, Vol. 29, Iss. 2, 2012-07 ,pp. :