Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kasymov, N. Kh.
and
Dadazhanov, R. N.
2017.
Negative Dense Linear Orders.
Siberian Mathematical Journal,
Vol. 58,
Issue. 6,
p.
1015.
Khoussainov, Bakh
2018.
Sailing Routes in the World of Computation.
Vol. 10936,
Issue. ,
p.
1.
Bazhenov, N. A.
and
Kalmurzaev, B. S.
2018.
On Dark Computably Enumerable Equivalence Relations.
Siberian Mathematical Journal,
Vol. 59,
Issue. 1,
p.
22.
Andrews, Uri
Sorbi, Andea
Brattka, Vasco
Downey, Rod
Knight, Julia F.
and
Lempp, Steffen
2019.
Joins and meets in the structure of ceers.
Computability,
Vol. 8,
Issue. 3-4,
p.
193.
Andrews, Uri
Schweber, Noah
and
Sorbi, Andrea
2020.
Self-full ceers and the uniform join operator.
Journal of Logic and Computation,
Vol. 30,
Issue. 3,
p.
765.
Delle Rose, Valentino
San Mauro, Luca
and
Sorbi, Andrea
2020.
Word problems and ceers.
Mathematical Logic Quarterly,
Vol. 66,
Issue. 3,
p.
341.
Andrews, Uri
Schweber, Noah
and
Sorbi, Andrea
2020.
The theory of ceers computes true arithmetic.
Annals of Pure and Applied Logic,
Vol. 171,
Issue. 8,
p.
102811.
Bazhenov, Nikolay
Mustafa, Manat
San Mauro, Luca
Sorbi, Andrea
and
Yamaleev, Mars
2020.
Classifying equivalence relations in the Ershov hierarchy.
Archive for Mathematical Logic,
Vol. 59,
Issue. 7-8,
p.
835.
ANDREWS, URI
and
SORBI, ANDREA
2021.
EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS.
The Review of Symbolic Logic,
Vol. 14,
Issue. 4,
p.
838.
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.
Belanger, David
Gao, Ziyuan
Jain, Sanjay
Li, Wei
and
Stephan, Frank
2021.
Language and Automata Theory and Applications.
Vol. 12638,
Issue. ,
p.
145.
Kasymov, N. Kh.
and
Ibragimov, F. N.
2022.
Computably Separable Models.
Journal of Mathematical Sciences,
Vol. 264,
Issue. 6,
p.
746.
ANDREWS, URI
and
SORBI, ANDREA
2022.
INITIAL SEGMENTS OF THE DEGREES OF CEERS.
The Journal of Symbolic Logic,
Vol. 87,
Issue. 3,
p.
1260.
Bazhenov, Nikolay
and
Zubkov, Maxim
2022.
Revolutions and Revelations in Computability.
Vol. 13359,
Issue. ,
p.
13.
Delle Rose, Valentino
San Mauro, Luca
and
Sorbi, Andrea
2023.
Classifying word problems of finitely generated algebras via computable reducibility.
International Journal of Algebra and Computation,
Vol. 33,
Issue. 04,
p.
751.
Belanger, David
Gao, Ziyuan
Jain, Sanjay
Li, Wei
and
Stephan, Frank
2023.
Learnability and positive equivalence relations.
Information and Computation,
Vol. 295,
Issue. ,
p.
104913.
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.
Kasymov, Nadim
Karimova, Nadira
and
Khoussainov, Bakh
2024.
Defining algorithmically presented structures in first order logic.
p.
1.
ANDREWS, URI
and
SAN MAURO, LUCA
2024.
INVESTIGATING THE COMPUTABLE FRIEDMAN–STANLEY JUMP.
The Journal of Symbolic Logic,
Vol. 89,
Issue. 2,
p.
918.