Publisher： Cambridge University Press
E-ISSN： 1943-5886|63|3|1095-1115
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.63, Iss.3, 1998-09, pp. : 1095-1115
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
NP search problems in low fragments of bounded arithmetic
The Journal of Symbolic Logic, Vol. 72, Iss. 2, 2007-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. :
Gödel sentences of bounded arithmetic
The Journal of Symbolic Logic, Vol. 65, Iss. 3, 2000-09 ,pp. :
Forcing on bounded arithmetic II
The Journal of Symbolic Logic, Vol. 63, Iss. 3, 1998-09 ,pp. :
Notes on polynomially bounded arithmetic
The Journal of Symbolic Logic, Vol. 61, Iss. 3, 1996-09 ,pp. :