Publisher： Cambridge University Press
E-ISSN： 1943-5894|16|3|345-358
ISSN： 1079-8986
Source： Bulletin of Symbolic Logic, Vol.16, Iss.3, 2010-09, pp. : 345-358
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
On the complexity of models of arithmetic
The Journal of Symbolic Logic, Vol. 47, Iss. 2, 1982-06 ,pp. :
Access to resources
Recommend
On models of arithmetic—Answers to two problems raised by H. Gaifman
The Journal of Symbolic Logic, Vol. 40, Iss. 1, 1975-03 ,pp. :
Undecidable complexity statements in
The Journal of Symbolic Logic, Vol. 54, Iss. 2, 1989-06 ,pp. :
Implicational complexity in intuitionistic arithmetic
The Journal of Symbolic Logic, Vol. 46, Iss. 2, 1981-06 ,pp. :
Definability and decision problems in arithmetic
The Journal of Symbolic Logic, Vol. 14, Iss. 2, 1949-06 ,pp. :