Serikzhan A. Badaev

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 4

Top Topics

Rough Set Approximations

Concept Lattice

Recursively Enumerable

Equivalence Relation

Top Venues

Arch. Math. Log.

Computability and Complexity

Publications

Serikzhan A. Badaev, Nikolay A. Bazhenov, Birzhan S. Kalmurzayev, Manat Mustafa
On diagonal functions for equivalence relations. Arch. Math. Log. 63 (3-4) (2024)
Uri Andrews, Serikzhan A. Badaev
On Isomorphism Classes of computably Enumerable Equivalence Relations. J. Symb. Log. 85 (1) (2020)
Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi
A Survey on Universal Computably Enumerable Equivalence Relations. Computability and Complexity (2017)
Serikzhan A. Badaev, Andrea Sorbi
Weakly precomplete computably enumerable equivalence relations. Math. Log. Q. 62 (1-2) (2016)
Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi
Friedberg numberings in the Ershov hierarchy. Arch. Math. Log. 54 (1-2) (2015)
Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi
Rogers semilattices of families of two embedded sets in the Ershov hierarchy. Math. Log. Q. 58 (4-5) (2012)
Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey S. Goncharov
Inductive inference and computable numberings. Theor. Comput. Sci. 412 (18) (2011)
Serikzhan A. Badaev, Steffen Lempp
A decomposition of the Rogers semilattice of a family of d.c.e. sets. J. Symb. Log. 74 (2) (2009)
Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov
On a Question of Frank Stephan. TAMC (2008)
Serikzhan A. Badaev
On Rogers Semilattices. TAMC (2006)
Serikzhan A. Badaev, Dieter Spreen
A note on partial numberings. Math. Log. Q. 51 (2) (2005)
Serikzhan A. Badaev
Computable Numberings. LPAR (2003)
Sergei S. Goncharov, Serikzhan A. Badaev
Classes with Pairwise Equivalent Enumerations. LFCS (1994)