Publisher： Cambridge University Press
E-ISSN： 1943-5886|72|3|959-993
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.72, Iss.3, 2007-09, pp. : 959-993
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
Approximate counting by hashing in bounded arithmetic
The Journal of Symbolic Logic, Vol. 74, Iss. 3, 2009-09 ,pp. :
Access to resources
Recommend
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. :
FRAGMENTS OF APPROXIMATE COUNTING
The Journal of Symbolic Logic, Vol. 79, Iss. 2, 2014-06 ,pp. :