# Serikzhan A. Badaev

According to our database

Collaborative distances:

^{1}, Serikzhan A. Badaev authored at least 10 papers between 2003 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

A Survey on Universal Computably Enumerable Equivalence Relations.

Proceedings of the Computability and Complexity, 2017

2016

Weakly precomplete computably enumerable equivalence relations.

Math. Log. Q., 2016

2015

Friedberg numberings in the Ershov hierarchy.

Arch. Math. Log., 2015

2012

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

Math. Log. Q., 2012

2011

Inductive inference and computable numberings.

Theor. Comput. Sci., 2011

2009

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

J. Symb. Log., 2009

2008

On a Question of Frank Stephan.

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

2006

On Rogers Semilattices.

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

2005

A note on partial numberings.

Math. Log. Q., 2005

2003

Computable Numberings.

Proceedings of the Logic for Programming, 2003