Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Harizanov, Valentina S.
2002.
Computability-Theoretic Complexity of Countable Structures.
Bulletin of Symbolic Logic,
Vol. 8,
Issue. 4,
p.
457.
Goncharov, Sergey
Harizanov, Valentina
Laskowski, Michael
Lempp, Steffen
and
McCoy, Charles
2003.
Trivial, strongly minimal theories are model complete after naming constants.
Proceedings of the American Mathematical Society,
Vol. 131,
Issue. 12,
p.
3901.
Baldwin, John T.
and
Holland, Kitty
2004.
Constructing ω-stable structures: model completeness.
Annals of Pure and Applied Logic,
Vol. 125,
Issue. 1-3,
p.
159.
Dolich, Alfred
Laskowski, Michael C.
and
Raichev, Alexander
2006.
Model completeness for trivial, uncountably categorical theories of Morley rank 1.
Archive for Mathematical Logic,
Vol. 45,
Issue. 8,
p.
931.
Fokina, E. B.
2007.
Index sets of decidable models.
Siberian Mathematical Journal,
Vol. 48,
Issue. 5,
p.
939.
Soskova, Alexandra A.
2007.
Computation and Logic in the Real World.
Vol. 4497,
Issue. ,
p.
716.
Fokina, Ekaterina B.
2007.
Computation and Logic in the Real World.
Vol. 4497,
Issue. ,
p.
290.
Gavryushkin, A. N.
2007.
Spectra of computable models for Ehrenfeucht theories.
Algebra and Logic,
Vol. 46,
Issue. 3,
p.
149.
Pavlovskii, E. N.
2008.
Estimation of the algorithmic complexity of classes of computable models.
Siberian Mathematical Journal,
Vol. 49,
Issue. 3,
p.
512.
Soskova, A. A.
and
Soskov, I. N.
2009.
A Jump Inversion Theorem for the Degree Spectra.
Journal of Logic and Computation,
Vol. 19,
Issue. 1,
p.
199.
Cenzer, Douglas
Harizanov, Valentina
Marker, David
and
Wood, Carol
2009.
Preface.
Archive for Mathematical Logic,
Vol. 48,
Issue. 1,
p.
1.
Fokina, Ekaterina B.
2009.
Index sets for some classes of structures.
Annals of Pure and Applied Logic,
Vol. 157,
Issue. 2-3,
p.
139.
Harizanov, V.
Miller, R.
and
Morozov, A. S.
2010.
Simple structures with complex symmetry.
Algebra and Logic,
Vol. 49,
Issue. 1,
p.
68.
Fokina, Ekaterina B.
Kalimullin, Iskander
and
Miller, Russell
2010.
Degrees of categoricity of computable structures.
Archive for Mathematical Logic,
Vol. 49,
Issue. 1,
p.
51.
Vatev, Stefan
2011.
Models of Computation in Context.
Vol. 6735,
Issue. ,
p.
300.
Soskov, I. N.
2013.
Effective properties of Marker's extensions.
Journal of Logic and Computation,
Vol. 23,
Issue. 6,
p.
1335.
Csima, Barbara F.
Franklin, Johanna N. Y.
and
Shore, Richard A.
2013.
Degrees of Categoricity and the Hyperarithmetic Hierarchy.
Notre Dame Journal of Formal Logic,
Vol. 54,
Issue. 2,
Goncharov, S. S.
and
Marchuk, M. I.
2015.
Index Sets of Constructive Models that are Autostable Under Strong Constructivizations.
Journal of Mathematical Sciences,
Vol. 205,
Issue. 3,
p.
368.
Fokina, E. B.
Goncharov, S. S.
Harizanov, V.
Kudinov, O. V.
and
Turetsky, D.
2015.
Index Sets for n-Decidable Structures Categorical Relative to m-Decidable Presentations.
Algebra and Logic,
Vol. 54,
Issue. 4,
p.
336.
Goncharov, S. S.
Bazhenov, N. A.
and
Marchuk, M. I.
2015.
The index set of Boolean algebras autostable relative to strong constructivizations.
Siberian Mathematical Journal,
Vol. 56,
Issue. 3,
p.
393.