Publisher： Cambridge University Press
E-ISSN： 1943-5886|74|4|1325-1351
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.74, Iss.4, 2009-12, pp. : 1325-1351
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
Computable categoricity of trees of finite height
The Journal of Symbolic Logic, Vol. 70, Iss. 1, 2005-03 ,pp. :
Access to resources
Recommend
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
The Journal of Symbolic Logic, Vol. 80, Iss. 1, 2015-03 ,pp. :
A note on computable real fields
The Journal of Symbolic Logic, Vol. 35, Iss. 2, 1970-06 ,pp. :
Weak presentations of computable fields
The Journal of Symbolic Logic, Vol. 60, Iss. 1, 1995-03 ,pp. :
The isomorphism problem for classes of computable fields
Archive for Mathematical Logic, Vol. 43, Iss. 3, 2004-04 ,pp. :