Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bazhenov, N. A.
Frolov, A. N.
Kalimullin, I. Sh.
and
Melnikov, A. G.
2017.
Computability of Distributive Lattices.
Siberian Mathematical Journal,
Vol. 58,
Issue. 6,
p.
959.
Miller, Russell
2017.
Unveiling Dynamics and Complexity.
Vol. 10307,
Issue. ,
p.
88.
Bazhenov, Nikolay
2017.
Unveiling Dynamics and Complexity.
Vol. 10307,
Issue. ,
p.
141.
Harrison-Trainor, Matthew
2018.
Computable valued fields.
Archive for Mathematical Logic,
Vol. 57,
Issue. 5-6,
p.
473.
Melnikov, Alexander G.
2018.
Torsion-free abelian groups with optimal Scott families.
Journal of Mathematical Logic,
Vol. 18,
Issue. 01,
p.
1850002.
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.
Bazhenov, Nikolay
Ganchev, Hristo
and
Vatev, Stefan
2019.
Computing with Foresight and Industry.
Vol. 11558,
Issue. ,
p.
84.
Harrison-Trainor, Matthew
Brattka, Vasco
Downey, Rod
Knight, Julia F.
and
Lempp, Steffen
2019.
A first-order theory of Ulm type.
Computability,
Vol. 8,
Issue. 3-4,
p.
347.
Miller, Russell
and
Ocasio González, Victor
2019.
Degree spectra of real closed fields.
Archive for Mathematical Logic,
Vol. 58,
Issue. 3-4,
p.
387.
BAZHENOV, NIKOLAY
DOWNEY, ROD
KALIMULLIN, ISKANDER
and
MELNIKOV, ALEXANDER
2019.
FOUNDATIONS OF ONLINE STRUCTURE THEORY.
The Bulletin of Symbolic Logic,
Vol. 25,
Issue. 2,
p.
141.
Faizrahmanov, Marat
Kach, Asher
Kalimullin, Iskander
Montalbán, Antonio
and
Puzarenko, Vadim
2019.
Jump inversions of algebraic structures and Σ‐definability.
Mathematical Logic Quarterly,
Vol. 65,
Issue. 1,
p.
37.
Avdeev, R. R.
and
Puzarenko, V. G.
2019.
A Computable Structure with Non-Standard Computability.
Siberian Advances in Mathematics,
Vol. 29,
Issue. 2,
p.
77.
Downey, Rod
Melnikov, Alexander
and
Ng, Keng Meng
2019.
Categorical linearly ordered structures.
Annals of Pure and Applied Logic,
Vol. 170,
Issue. 10,
p.
1243.
Downey, Rodney
Harrison-Trainor, Matthew
Kalimullin, Iskander
Melnikov, Alexander
and
Turetsky, Daniel
2020.
Graphs are not universal for online computability.
Journal of Computer and System Sciences,
Vol. 112,
Issue. ,
p.
1.
Bazhenov, Nikolay
and
Vatev, Stefan
2020.
Beyond the Horizon of Computability.
Vol. 12098,
Issue. ,
p.
1.
Melnikov, Alexander
and
Ng, Keng Meng
2020.
A structure of punctual dimension two.
Proceedings of the American Mathematical Society,
Vol. 148,
Issue. 7,
p.
3113.
Zubkov, M. V.
and
Frolov, A. N.
2020.
Spectral Universality of Linear Orders with One Binary Relation.
Siberian Mathematical Journal,
Vol. 61,
Issue. 3,
p.
463.
Csima, Barbara F.
Rossegger, Dino
and
Yu, Daniel
2021.
Connecting with Computability.
Vol. 12813,
Issue. ,
p.
385.
Harrison-Trainor, Matthew
and
Ho, Meng-Che “Turbo”
2021.
Finitely generated groups are universal among finitely generated structures.
Annals of Pure and Applied Logic,
Vol. 172,
Issue. 1,
p.
102855.
Bazhenov, N. A.
Ganchev, H.
and
Vatev, S.
2021.
Computable Embeddings for Pairs of Linear Orders.
Algebra and Logic,
Vol. 60,
Issue. 3,
p.
163.