Publisher： Cambridge University Press
E-ISSN： 1943-5886|57|2|466-477
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.57, Iss.2, 1992-06, pp. : 466-477
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
How to characterize provably total functions by local predicativity
The Journal of Symbolic Logic, Vol. 61, Iss. 1, 1996-03 ,pp. :
Witnessing functions in bounded arithmetic and search problems
The Journal of Symbolic Logic, Vol. 63, Iss. 3, 1998-09 ,pp. :
Implicational complexity in intuitionistic arithmetic
The Journal of Symbolic Logic, Vol. 46, Iss. 2, 1981-06 ,pp. :
Syntactic translations and provably recursive functions
The Journal of Symbolic Logic, Vol. 50, Iss. 3, 1985-09 ,pp. :