Kurt Gödel Research Center

2014 seminar talk: Computably enumerable equivalence relations

Talk held by Serikzhan Badaev (Al-Farabi Kazakh National University, Kazakhstan) at the KGRC seminar on 2014-12-04.

Abstract

I am going to remind (introduce) some classes of computably enumerable relations that are related to the idea of fixed point such as precomplete, weakly precomplete, uniformly finitely precomplete. These relations are considered with respect to m-reducibility. Some new joint results with Andrea Sorbi on interrelations of the mentioned above classes will be presented.