Publisher： Cambridge University Press
E-ISSN： 1943-5886|74|4|1352-1366
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.74, Iss.4, 2009-12, pp. : 1352-1366
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 Journal of Symbolic Logic, Vol. 72, Iss. 3, 2007-09 ,pp. :
Access to resources
Recommend
Computable embeddings and strongly minimal theories
The Journal of Symbolic Logic, Vol. 72, Iss. 3, 2007-09 ,pp. :
Infinite chains and antichains in computable partial Orderings
The Journal of Symbolic Logic, Vol. 66, Iss. 2, 2001-06 ,pp. :
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
The Journal of Symbolic Logic, Vol. 80, Iss. 1, 2015-03 ,pp. :