Publisher： Cambridge University Press
E-ISSN： 1943-5886|63|3|860-868
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.63, Iss.3, 1998-09, pp. : 860-868
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
Gödel sentences of bounded arithmetic
The Journal of Symbolic Logic, Vol. 65, Iss. 3, 2000-09 ,pp. :
Access to resources
Recommend
Notes on polynomially bounded arithmetic
The Journal of Symbolic Logic, Vol. 61, Iss. 3, 1996-09 ,pp. :
Approximate counting in bounded arithmetic
The Journal of Symbolic Logic, Vol. 72, Iss. 3, 2007-09 ,pp. :
The bounded proper forcing axiom
The Journal of Symbolic Logic, Vol. 60, Iss. 1, 1995-03 ,pp. :
A maximal bounded forcing axiom
The Journal of Symbolic Logic, Vol. 67, Iss. 1, 2002-03 ,pp. :