Videolibrary
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Video Library
Archive
Most viewed videos

Search
RSS
New in collection







August 12, 2021 15:20–16:05, Теория вычислимости и математическая логика, Sochi
 


On positive preorders

B. S. Kalmurzaevab, N. A. Bazhenovc, S. A. Badaevb

a Al-Farabi Kazakh National University, Faculty of Mechanics and Mathematics
b Kazakh-British Technical University
c Mathematical Center in Akademgorodok, Novosibirsk

Number of views:
This page:10


References
  1. 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
  2. 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
  3. U. Andrews, A. Sorbi, “Joins and meets in the structure of ceers”, Computability, 8:3-4 (2019), 193–241
  4. S. Badaev, A. Sorbi, “Weakly precomplete computably enumerable equivalence relations”, Mathematical Logic Quarterly, 62:1-2 (2016), 111–127


SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021