Serikzhan A. Badaev

According to our database, Serikzhan A. Badaev authored at least 13 papers between 1994 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

On diagonal functions for equivalence relations.

Serikzhan A. Badaev, Nikolay A. Bazhenov, Birzhan S. Kalmurzayev, Manat Mustafa

Arch. Math. Log., May, 2024

2020

On Isomorphism Classes of computably Enumerable Equivalence Relations.

Uri Andrews, Serikzhan A. Badaev

J. Symb. Log., 2020

2017

A Survey on Universal Computably Enumerable Equivalence Relations.

Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi

Proceedings of the Computability and Complexity, 2017

2016

Weakly precomplete computably enumerable equivalence relations.

Serikzhan A. Badaev, Andrea Sorbi

Math. Log. Q., 2016

2015

Friedberg numberings in the Ershov hierarchy.

Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi

Arch. Math. Log., 2015

2012

Rogers semilattices of families of two embedded sets in the Ershov hierarchy.

Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi

Math. Log. Q., 2012

2011

Inductive inference and computable numberings.

Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey S. Goncharov

Theor. Comput. Sci., 2011

2009

A decomposition of the Rogers semilattice of a family of d.c.e. sets.

Serikzhan A. Badaev, Steffen Lempp

J. Symb. Log., 2009

2008

On a Question of Frank Stephan.

Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov

Proceedings of the Theory and Applications of Models of Computation, 2008

2006

On Rogers Semilattices.

Serikzhan A. Badaev

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

A note on partial numberings.

Serikzhan A. Badaev, Dieter Spreen

Math. Log. Q., 2005

2003

Computable Numberings.

Serikzhan A. Badaev

Proceedings of the Logic for Programming, 2003

1994

Classes with Pairwise Equivalent Enumerations.

Sergei S. Goncharov, Serikzhan A. Badaev

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994