Publisher： Cambridge University Press
E-ISSN： 1943-5886|67|2|598-620
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.67, Iss.2, 2002-06, pp. : 598-620
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
Definability and decision problems in arithmetic
The Journal of Symbolic Logic, Vol. 14, Iss. 2, 1949-06 ,pp. :
Access to resources
Recommend
Arithmetic definability by formulas with two quantifiers
The Journal of Symbolic Logic, Vol. 57, Iss. 1, 1992-03 ,pp. :
Quasimaximality and principal filters isomorphism between
Archive for Mathematical Logic, Vol. 43, Iss. 3, 2004-04 ,pp. :
On external Scott algebras in nonstandard models of Peano arithmetic
The Journal of Symbolic Logic, Vol. 61, Iss. 2, 1996-06 ,pp. :
Borel complexity of isomorphism between quotient Boolean algebras
The Journal of Symbolic Logic, Vol. 73, Iss. 4, 2008-12 ,pp. :