Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kuske, Dietrich
2003.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 2850,
Issue. ,
p.
332.
Morozov, A. S.
2006.
Elementary submodels of parametrizable models.
Siberian Mathematical Journal,
Vol. 47,
Issue. 3,
p.
491.
Morozov, A. S.
and
Truss, J. K.
2007.
The categoricity of the group of all computable automorphisms of the rational numbers.
Algebra and Logic,
Vol. 46,
Issue. 5,
p.
354.
Morozov, A. S.
2008.
Definable sets in automorphism groups of rational order.
Algebra and Logic,
Vol. 47,
Issue. 2,
p.
125.
Morozov, Andrei S.
2010.
On computable presentations of some functional lattices.
The Journal of Logic and Algebraic Programming,
Vol. 79,
Issue. 1,
p.
38.
Fokina, Ekaterina B.
Harizanov, Valentina
and
Melnikov, Alexander
2014.
Turing's Legacy.
p.
124.
Kasymov, N. Kh.
and
Morozov, A. S.
2016.
Definability of Linear Orders over Negative Equivalences.
Algebra and Logic,
Vol. 55,
Issue. 1,
p.
24.
Kasymov, N. Kh.
and
Dadazhanov, R. N.
2017.
Negative Dense Linear Orders.
Siberian Mathematical Journal,
Vol. 58,
Issue. 6,
p.
1015.
Kasymov, N. Kh.
Dadazhanov, R. N.
and
Djavliev, S. K.
2021.
Structures of Degrees of Negative Representations of Linear Orders.
Russian Mathematics,
Vol. 65,
Issue. 12,
p.
27.
Kasymov, N. Kh.
and
Ibragimov, F. N.
2022.
Computably Separable Models.
Journal of Mathematical Sciences,
Vol. 264,
Issue. 6,
p.
746.
Kasymov, N. Kh.
and
Morozov, A. S.
2023.
Lower Semilattices of Separable Congruences of Numbered Algebras.
Siberian Mathematical Journal,
Vol. 64,
Issue. 4,
p.
864.
Kasymov, N. Kh.
Dadazhanov, R. N.
and
Ibragimov, F. N.
2024.
Separable Algorithmic Representations of Classical Systems and their Applications.
Journal of Mathematical Sciences,
Vol. 278,
Issue. 3,
p.
476.
Kornev, Ruslan
2024.
Twenty Years of Theoretical and Practical Synergies.
Vol. 14773,
Issue. ,
p.
405.