Publisher： Cambridge University Press
E-ISSN： 1943-5886|61|1|52-69
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.61, Iss.1, 1996-03, pp. : 52-69
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Classifying the Provably Total Functions of PA
Bulletin of Symbolic Logic, Vol. 12, Iss. 2, 2006-06 ,pp. :
Access to resources
Recommend
Provably total functions of intuitionistic bounded arithmetic
The Journal of Symbolic Logic, Vol. 57, Iss. 2, 1992-06 ,pp. :
Syntactic translations and provably recursive functions
The Journal of Symbolic Logic, Vol. 50, Iss. 3, 1985-09 ,pp. :
Invex functions and constrained local minima
Bulletin of the Australian Mathematical Society, Vol. 24, Iss. 3, 1981-12 ,pp. :
The Ackermann functions are not optimal, but by how much?
The Journal of Symbolic Logic, Vol. 75, Iss. 1, 2010-03 ,pp. :