Video library: B. S. Kalmurzaev, N. A. Bazhenov, S. A. Badaev, On positive preorders

VIDEO LIBRARY

On positive preorders B. S. Kalmurzaev^ab, N. A. Bazhenov^c, S. A. Badaev^b ^a Al-Farabi Kazakh National University, Faculty of Mechanics and Mathematics ^b Kazakh-British Technical University ^c Mathematical Center in Akademgorodok, Novosibirsk
References U. Andrews, S. Lempp, J. S. Miller, K. M. Ng, L. S. Mauro, A. Sorbi, “Universal computably enumerable equivalence relations”, The Journal of Symbolic Logic, 79:1 (2013), 60–88 U. Andrews, A. Sorbi, “The Complexity of index sets of classes of computably enumerable equivalence relations”, The Journal of Symbolic Logic, 81:4 (2016), 1375–1395 U. Andrews, A. Sorbi, “Joins and meets in the structure of ceers”, Computability, 8:3-4 (2019), 193–241 S. Badaev, A. Sorbi, “Weakly precomplete computably enumerable equivalence relations”, Mathematical Logic Quarterly, 62:1-2 (2016), 111–127