Publisher： Cambridge University Press
E-ISSN： 1943-5886|47|2|403-415
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.47, Iss.2, 1982-06, pp. : 403-415
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
The Complexity of Classification Problems for Models of Arithmetic
Bulletin of Symbolic Logic, Vol. 16, Iss. 3, 2010-09 ,pp. :
Access to resources
Recommend
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. :
Addition in nonstandard models of arithmetic
The Journal of Symbolic Logic, Vol. 37, Iss. 3, 1972-09 ,pp. :
Models of arithmetic and closed ideals
The Journal of Symbolic Logic, Vol. 47, Iss. 4, 1982-12 ,pp. :