Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Harrison-Trainor, Matthew
2018.
There is no classification of the decidably presentable structures.
Journal of Mathematical Logic,
Vol. 18,
Issue. 02,
p.
1850010.
Kalimullin, Iskander
Miller, Russell
and
Schoutens, Hans
2019.
Computing with Foresight and Industry.
Vol. 11558,
Issue. ,
p.
205.
Bazhenov, Nikolay
Ganchev, Hristo
and
Vatev, Stefan
2019.
Computing with Foresight and Industry.
Vol. 11558,
Issue. ,
p.
84.
Kalimullin, I. Sh.
and
Miller, R.
2019.
Primitive Recursive Fields and Categoricity.
Algebra and Logic,
Vol. 58,
Issue. 1,
p.
95.
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, N. A.
and
Harrison-Trainor, M.
2019.
Constructing Decidable Graphs from Decidable Structures.
Algebra and Logic,
Vol. 58,
Issue. 5,
p.
369.
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.
Bazhenov, Nikolay
and
Vatev, Stefan
2020.
Beyond the Horizon of Computability.
Vol. 12098,
Issue. ,
p.
1.
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.
Csima, Barbara F.
Rossegger, Dino
and
Yu, Daniel
2021.
Connecting with Computability.
Vol. 12813,
Issue. ,
p.
385.
Chubb, Jennifer
Miller, Russell
and
Solomon, Reed
2021.
Model completeness and relative decidability.
Archive for Mathematical Logic,
Vol. 60,
Issue. 6,
p.
721.
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.
Miller, Russell
2021.
Connecting with Computability.
Vol. 12813,
Issue. ,
p.
342.
Bazhenov, Nikolay
and
Tsai, Hsing‐Chien
2022.
On the effective universality of mereological theories.
Mathematical Logic Quarterly,
Vol. 68,
Issue. 1,
p.
48.
ALVIR, RACHAEL
CALVERT, WESLEY
GOODMAN, GRANT
HARIZANOV, VALENTINA
KNIGHT, JULIA
MILLER, RUSSELL
MOROZOV, ANDREY
SOSKOVA, ALEXANDRA
and
WEISSHAAR, ROSE
2022.
INTERPRETING A FIELD IN ITS HEISENBERG GROUP.
The Journal of Symbolic Logic,
Vol. 87,
Issue. 3,
p.
1215.
Knight, J. F.
2023.
Classes of Algebraic Structures.
Journal of Mathematical Sciences,
Vol. 275,
Issue. 1,
p.
16.
Bazhenov, Nikolay
2023.
Computable Heyting Algebras with Distinguished Atoms and Coatoms.
Journal of Logic, Language and Information,
Vol. 32,
Issue. 1,
p.
3.