Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
2001.
Badaev, Serikzhan
and
Sorbi, Andrea
2016.
Weakly precomplete computably enumerable equivalence relations.
Mathematical Logic Quarterly,
Vol. 62,
Issue. 1-2,
p.
111.
Downey, Rodney G.
Melnikov, Alexander G.
and
Ng, Keng Meng
2017.
A Friedberg enumeration of equivalence structures.
Journal of Mathematical Logic,
Vol. 17,
Issue. 02,
p.
1750008.
Khoussainov, Bakh
2018.
Sailing Routes in the World of Computation.
Vol. 10936,
Issue. ,
p.
1.
Andrews, Uri
and
Sorbi, Andrea
2018.
Jumps of computably enumerable equivalence relations.
Annals of Pure and Applied Logic,
Vol. 169,
Issue. 3,
p.
243.
NIES, ANDRÉ
and
SORBI, ANDREA
2018.
Calibrating word problems of groups via the complexity of equivalence relations.
Mathematical Structures in Computer Science,
Vol. 28,
Issue. 3,
p.
457.
Bazhenov, Nikolay
Mustafa, Manat
and
Yamaleev, Mars
2019.
Theory and Applications of Models of Computation.
Vol. 11436,
Issue. ,
p.
28.
Bazhenov, Nikolay
Mustafa, Manat
and
Yamaleev, Mars
2019.
Elementary theories and hereditary undecidability for semilattices of numberings.
Archive for Mathematical Logic,
Vol. 58,
Issue. 3-4,
p.
485.
Fokina, Ekaterina
Rossegger, Dino
San Mauro, Luca
Brattka, Vasco
Downey, Rod
Knight, Julia F.
and
Lempp, Steffen
2019.
Measuring the complexity of reductions between equivalence relations.
Computability,
Vol. 8,
Issue. 3-4,
p.
265.
Delle Rose, Valentino
San Mauro, Luca
and
Sorbi, Andrea
2020.
Word problems and ceers.
Mathematical Logic Quarterly,
Vol. 66,
Issue. 3,
p.
341.
Epstein, Rachel
and
Lange, Karen
2020.
Agreement reducibility.
Mathematical Logic Quarterly,
Vol. 66,
Issue. 4,
p.
448.
Badaev, S. A.
Bazhenov, N. A.
and
Kalmurzaev, B. S.
2020.
The Structure of Computably Enumerable Preorder Relations.
Algebra and Logic,
Vol. 59,
Issue. 3,
p.
201.
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
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.
Sorbi, Andrea
2021.
Connecting with Computability.
Vol. 12813,
Issue. ,
p.
417.
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
Mustafa, Manat
2022.
Computable embeddability for algebraic structures.
Asian-European Journal of Mathematics,
Vol. 15,
Issue. 07,
Golov, Anton
and
Terwijn, Sebastiaan A.
2022.
Fixpoints and relative precompleteness.
Computability,
Vol. 11,
Issue. 2,
p.
135.
Greenberg, Noam
and
Turetsky, Daniel
2022.
Completeness of the hyperarithmetic isomorphism equivalence relation.
Advances in Mathematics,
Vol. 403,
Issue. ,
p.
108356.
Bazhenov, Nikolay
Ng, Keng Meng
San Mauro, Luca
Sorbi, Andrea
Brattka, Vasco
Greenberg, Noam
Kalimullin, Iskander
and
Soskova, Mariya
2022.
Primitive recursive equivalence relations and their primitive recursive complexity.
Computability,
Vol. 11,
Issue. 3-4,
p.
187.