Publisher： Cambridge University Press
E-ISSN： 1943-5886|48|4|913-920
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.48, Iss.4, 1983-12, pp. : 913-920
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
Syntactic translations and provably recursive functions
The Journal of Symbolic Logic, Vol. 50, Iss. 3, 1985-09 ,pp. :
Access to resources
Recommend
The Journal of Symbolic Logic, Vol. 28, Iss. 1, 1963-03 ,pp. :
Classifying the Provably Total Functions of PA
Bulletin of Symbolic Logic, Vol. 12, Iss. 2, 2006-06 ,pp. :
Provably Fast Training Algorithms for Support Vector Machines
Theory of Computing Systems, Vol. 42, Iss. 4, 2008-05 ,pp. :
Provably total functions of intuitionistic bounded arithmetic
The Journal of Symbolic Logic, Vol. 57, Iss. 2, 1992-06 ,pp. :