×

zbMATH — the first resource for mathematics

Badaev, Serikzhan A.

Compute Distance To:
Author ID: badaev.serikzhan-a Recent zbMATH articles by "Badaev, Serikzhan A."
Published as: Badaev, S. A.; Badaev, Serikzhan; Badaev, Serikzhan A.
External Links: MGP · ORCID
Documents Indexed: 38 Publications since 1974

Publications by Year

Citations contained in zbMATH Open

30 Publications have been cited 123 times in 53 Documents Cited by Year
The theory of numberings: Open problems. Zbl 0961.03038
Badaev, Serikzhan; Goncharov, Sergey
15
2000
Generalized computable universal numberings. Zbl 1318.03050
Badaev, S. A.; Goncharov, S. S.
10
2014
Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy. Zbl 1164.03340
Badaev, S. A.; Goncharov, S. S.; Sorbi, A.
10
2006
A decomposition of the Rogers semilattice of a family of d.c.e. sets. Zbl 1185.03071
Badaev, Serikzhan A.; Lempp, Steffen
8
2009
A survey on universal computably enumerable equivalence relations. Zbl 06700071
Andrews, Uri; Badaev, Serikzhan; Sorbi, Andrea
8
2017
Elementary theories for Rogers semilattices. Zbl 1106.03041
Badaev, S. A.; Goncharov, S. S.; Sorbi, Andrea
7
2005
Weakly precomplete computably enumerable equivalence relations. Zbl 1361.03043
Badaev, Serikzhan; Sorbi, Andrea
7
2016
On weakly pre-complete positive equivalences. Zbl 0733.03034
Badaev, S. A.
5
1991
Positive enumerations. Zbl 0411.03036
Badaev, S. A.
5
1978
Computable enumerations of families of general recursive functions. Zbl 0399.03028
Badaev, S. A.
5
1978
Computability and numberings. Zbl 1157.03022
Badaev, Serikzhan; Goncharov, Sergey
5
2008
Rogers semilattices of families of two embedded sets in the Ershov hierarchy. Zbl 1257.03071
Badaev, Serikzhan A.; Manat, Mustafa; Sorbi, Andrea
4
2012
Elementary properties of Rogers semilattices of arithmetical numberings. Zbl 1054.03033
Badaev, S. A.; Goncharov, S. S.; Sorbi, A.
4
2003
Rogers semilattices of families of arithmetic sets. Zbl 0989.03040
Badaev, S. A.; Goncharov, S. S.
4
2001
Families without minimal numberings. Zbl 1318.03049
Abeshev, K. Sh.; Badaev, S. A.; Mustafa, M.
3
2014
Computable numberings in the hierarchy of Ershov. Zbl 1123.03042
Badaev, S. A.; Talasbaeva, Zh. T.
3
2006
On positive numerations. Zbl 0358.02047
Badaev, S. A.
3
1977
Minimal coverings in the Rogers semilattices of \(\Sigma^0_n\)-computable numberings. Zbl 1008.03026
Badaev, S. A.; Podzorov, S. Yu.
3
2002
On computable numberings of families of general recursive functions. Zbl 0388.03018
Badaev, S. A.
2
1977
Inductive inference and computable numberings. Zbl 1221.03035
Ambos-Spies, Klaus; Badaev, Serikzhan; Goncharov, Sergey
2
2011
Some absolute properties of \(A\)-computable numberings. Zbl 07035851
Badaev, S. A.; Issakhov, A. A.
1
2018
On isomorphism classes of computably enumerable equivalence relations. Zbl 1452.03092
Andrews, Uri; Badaev, Serikzhan A.
1
2020
A note on partial numberings. Zbl 1080.03030
Badaev, Serikzhan; Spreen, Dieter
1
2005
On a question of Frank Stephan. Zbl 1140.03313
Ambos-Spies, Klaus; Badaev, Serikzhan; Goncharov, Sergey
1
2008
A problem of S. S. Goncharov. Zbl 0749.03034
Badaev, S. A.
1
1991
On minimal numerations. Zbl 0856.03037
Badaev, S. A.
1
1993
On cardinality of semilattices of enumerations of nondiscrete families. Zbl 0807.03028
Badaev, S. A.
1
1993
Minimal numerations of positively computable families. Zbl 0819.03036
Badaev, S. A.
1
1994
Classes with pairwise equivalent enumerations. Zbl 0969.03513
Goncharov, S. S.; Badaev, S. A.
1
1994
Friedberg numberings in the Ershov hierarchy. Zbl 1341.03055
Badaev, Serikzhan A.; Manat, Mustafa; Sorbi, Andrea
1
2015
On isomorphism classes of computably enumerable equivalence relations. Zbl 1452.03092
Andrews, Uri; Badaev, Serikzhan A.
1
2020
Some absolute properties of \(A\)-computable numberings. Zbl 07035851
Badaev, S. A.; Issakhov, A. A.
1
2018
A survey on universal computably enumerable equivalence relations. Zbl 06700071
Andrews, Uri; Badaev, Serikzhan; Sorbi, Andrea
8
2017
Weakly precomplete computably enumerable equivalence relations. Zbl 1361.03043
Badaev, Serikzhan; Sorbi, Andrea
7
2016
Friedberg numberings in the Ershov hierarchy. Zbl 1341.03055
Badaev, Serikzhan A.; Manat, Mustafa; Sorbi, Andrea
1
2015
Generalized computable universal numberings. Zbl 1318.03050
Badaev, S. A.; Goncharov, S. S.
10
2014
Families without minimal numberings. Zbl 1318.03049
Abeshev, K. Sh.; Badaev, S. A.; Mustafa, M.
3
2014
Rogers semilattices of families of two embedded sets in the Ershov hierarchy. Zbl 1257.03071
Badaev, Serikzhan A.; Manat, Mustafa; Sorbi, Andrea
4
2012
Inductive inference and computable numberings. Zbl 1221.03035
Ambos-Spies, Klaus; Badaev, Serikzhan; Goncharov, Sergey
2
2011
A decomposition of the Rogers semilattice of a family of d.c.e. sets. Zbl 1185.03071
Badaev, Serikzhan A.; Lempp, Steffen
8
2009
Computability and numberings. Zbl 1157.03022
Badaev, Serikzhan; Goncharov, Sergey
5
2008
On a question of Frank Stephan. Zbl 1140.03313
Ambos-Spies, Klaus; Badaev, Serikzhan; Goncharov, Sergey
1
2008
Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy. Zbl 1164.03340
Badaev, S. A.; Goncharov, S. S.; Sorbi, A.
10
2006
Computable numberings in the hierarchy of Ershov. Zbl 1123.03042
Badaev, S. A.; Talasbaeva, Zh. T.
3
2006
Elementary theories for Rogers semilattices. Zbl 1106.03041
Badaev, S. A.; Goncharov, S. S.; Sorbi, Andrea
7
2005
A note on partial numberings. Zbl 1080.03030
Badaev, Serikzhan; Spreen, Dieter
1
2005
Elementary properties of Rogers semilattices of arithmetical numberings. Zbl 1054.03033
Badaev, S. A.; Goncharov, S. S.; Sorbi, A.
4
2003
Minimal coverings in the Rogers semilattices of \(\Sigma^0_n\)-computable numberings. Zbl 1008.03026
Badaev, S. A.; Podzorov, S. Yu.
3
2002
Rogers semilattices of families of arithmetic sets. Zbl 0989.03040
Badaev, S. A.; Goncharov, S. S.
4
2001
The theory of numberings: Open problems. Zbl 0961.03038
Badaev, Serikzhan; Goncharov, Sergey
15
2000
Minimal numerations of positively computable families. Zbl 0819.03036
Badaev, S. A.
1
1994
Classes with pairwise equivalent enumerations. Zbl 0969.03513
Goncharov, S. S.; Badaev, S. A.
1
1994
On minimal numerations. Zbl 0856.03037
Badaev, S. A.
1
1993
On cardinality of semilattices of enumerations of nondiscrete families. Zbl 0807.03028
Badaev, S. A.
1
1993
On weakly pre-complete positive equivalences. Zbl 0733.03034
Badaev, S. A.
5
1991
A problem of S. S. Goncharov. Zbl 0749.03034
Badaev, S. A.
1
1991
Positive enumerations. Zbl 0411.03036
Badaev, S. A.
5
1978
Computable enumerations of families of general recursive functions. Zbl 0399.03028
Badaev, S. A.
5
1978
On positive numerations. Zbl 0358.02047
Badaev, S. A.
3
1977
On computable numberings of families of general recursive functions. Zbl 0388.03018
Badaev, S. A.
2
1977

Citations by Year