Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Laskowski, Chris
2008.
2008 Annual Meeting of the Association for Symbolic Logic.
Bulletin of Symbolic Logic,
Vol. 14,
Issue. 3,
p.
418.
Calvert, W.
Goncharov, S. S.
Knight, J. F.
and
Millar, Jessica
2009.
Categoricity of computable infinitary theories.
Archive for Mathematical Logic,
Vol. 48,
Issue. 1,
p.
25.
Cenzer, Douglas
Harizanov, Valentina
Marker, David
and
Wood, Carol
2009.
Preface.
Archive for Mathematical Logic,
Vol. 48,
Issue. 1,
p.
1.
Fokina, E.
Friedman, S.-D.
Knight, J.
and
Miller, R.
2013.
Classes of structures with universe a subset of 1.
Journal of Logic and Computation,
Vol. 23,
Issue. 6,
p.
1249.
Fokina, Ekaterina B.
Harizanov, Valentina
and
Melnikov, Alexander
2014.
Turing's Legacy.
p.
124.
MELNIKOV, ALEXANDER G.
2014.
COMPUTABLE ABELIAN GROUPS.
The Bulletin of Symbolic Logic,
Vol. 20,
Issue. 3,
p.
315.
Becker, Howard
2017.
Strange Structures from Computable Model Theory.
Notre Dame Journal of Formal Logic,
Vol. 58,
Issue. 1,
Adams, Francis
and
Cenzer, Douglas
2017.
Computability and categoricity of weakly ultrahomogeneous structures.
Computability,
Vol. 6,
Issue. 4,
p.
365.
Chan, William
2017.
The countable admissible ordinal equivalence relation.
Annals of Pure and Applied Logic,
Vol. 168,
Issue. 6,
p.
1224.
Harrison-Trainor, Matthew
2018.
Scott ranks of models of a theory.
Advances in Mathematics,
Vol. 330,
Issue. ,
p.
109.
Harrison-Trainor, Matthew
Igusa, Gregory
and
Knight, Julia
2018.
Some new computable structures of high rank.
Proceedings of the American Mathematical Society,
Vol. 146,
Issue. 7,
p.
3097.
HARRISON-TRAINOR, MATTHEW
2022.
AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS.
The Bulletin of Symbolic Logic,
Vol. 28,
Issue. 1,
p.
71.
CALVERT, WESLEY
FRANKLIN, JOHANNA N. Y.
and
TURETSKY, DAN
2023.
STRUCTURAL HIGHNESS NOTIONS.
The Journal of Symbolic Logic,
Vol. 88,
Issue. 4,
p.
1692.