Author： Gavryushkin A.
Publisher： Springer Publishing Company
ISSN： 0002-5232
Source： Algebra and Logic, Vol.45, Iss.5, 2006-09, pp. : 289-295
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
On the complexity of models of arithmetic
The Journal of Symbolic Logic, Vol. 47, Iss. 2, 1982-06 ,pp. :
Access to resources
Recommend
Complexity of Categorical Theories with Computable Models
By Goncharov S. S. Khoussainov B.
Algebra and Logic, Vol. 43, Iss. 6, 2004-11 ,pp. :
The Complexity of Classification Problems for Models of Arithmetic
Bulletin of Symbolic Logic, Vol. 16, Iss. 3, 2010-09 ,pp. :
On Ehrenfeucht-Fraïssé equivalence of linear orderings
The Journal of Symbolic Logic, Vol. 55, Iss. 1, 1990-03 ,pp. :