Publisher： Cambridge University Press
E-ISSN： 1943-5886|40|1|41-47
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.40, Iss.1, 1975-03, pp. : 41-47
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
Two theorems on degrees of models of true arithmetic
The Journal of Symbolic Logic, Vol. 49, Iss. 2, 1984-06 ,pp. :
Definability and decision problems in arithmetic
The Journal of Symbolic Logic, Vol. 14, Iss. 2, 1949-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. :