On diagonal functions for equivalence relations. - Serikzhan A. Badaev; Nikolay A. Bazhenov; Birzhan S. Kalmurzayev; Manat Mustafa (Arch. Math. Log., 2024)

A non-computable c.e. closed subset of [0,1]. - Serikzhan A. Badaev; Nikolay Bazhenov 001; Sergey Goncharov 002; Birzhan S. Kalmurzayev; Alexander G. Melnikov (J. Log. Comput., 2025)

Computably enumerable equivalence relations via primitive recursive reductions. - Birzhan S. Kalmurzayev; Nikolay A. Bazhenov; Alibek M. Iskakov (J. Log. Comput., 2025)

Undecidability of the degree structure of primitive recursive m-reducibility. - Birzhan S. Kalmurzayev; Nikolay Bazhenov 001; Alibek M. Iskakov (J. Log. Comput., 2025)