Serikzhan A. Badaev

14 papers B 1C 2Misc 1Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
A non-computable c.e. closed subset of [0,1].
J. Log. Comput.
Serikzhan A. Badaev, Nikolay Bazhenov, Sergey Goncharov, Birzhan S. Kalmurzayev, Alexander G. Melnikov
2024 J jnl
On diagonal functions for equivalence relations.
Arch. Math. Log.
Serikzhan A. Badaev, Nikolay A. Bazhenov, Birzhan S. Kalmurzayev, Manat Mustafa
2020 J jnl
On Isomorphism Classes of computably Enumerable Equivalence Relations.
J. Symb. Log.
Uri Andrews, Serikzhan A. Badaev
2017 — conf
A Survey on Universal Computably Enumerable Equivalence Relations.
Computability and Complexity
Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi
2016 J jnl
Weakly precomplete computably enumerable equivalence relations.
Math. Log. Q.
Serikzhan A. Badaev, Andrea Sorbi
2015 J jnl
Friedberg numberings in the Ershov hierarchy.
Arch. Math. Log.
Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi
2012 J jnl
Rogers semilattices of families of two embedded sets in the Ershov hierarchy.
Math. Log. Q.
Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi
2011 J jnl
Inductive inference and computable numberings.
Theor. Comput. Sci.
Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey S. Goncharov
2009 J jnl
A decomposition of the Rogers semilattice of a family of d.c.e. sets.
J. Symb. Log.
Serikzhan A. Badaev, Steffen Lempp
2008 C conf
On a Question of Frank Stephan.
TAMC
Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov
2006 C conf
On Rogers Semilattices.
TAMC
Serikzhan A. Badaev
2005 J jnl
A note on partial numberings.
Math. Log. Q.
Serikzhan A. Badaev, Dieter Spreen
2003 B conf
Computable Numberings.
LPAR
Serikzhan A. Badaev
1994 Misc conf
Classes with Pairwise Equivalent Enumerations.
LFCS
Sergei S. Goncharov, Serikzhan A. Badaev