S. A. Badaev

522 total citations
30 papers, 157 citations indexed

About

S. A. Badaev is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, S. A. Badaev has authored 30 papers receiving a total of 157 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 8 papers in Geometry and Topology and 7 papers in Artificial Intelligence. Recurrent topics in S. A. Badaev's work include Computability, Logic, AI Algorithms (23 papers), semigroups and automata theory (15 papers) and Advanced Topology and Set Theory (8 papers). S. A. Badaev is often cited by papers focused on Computability, Logic, AI Algorithms (23 papers), semigroups and automata theory (15 papers) and Advanced Topology and Set Theory (8 papers). S. A. Badaev collaborates with scholars based in Kazakhstan, Russia and Italy. S. A. Badaev's co-authors include С. С. Гончаров, Andrea Sorbi, Steffen Lempp, Nikolay Bazhenov and Klaus Ambos‐Spies and has published in prestigious journals such as Theoretical Computer Science, Journal of Symbolic Logic and Siberian Mathematical Journal.

In The Last Decade

S. A. Badaev

24 papers receiving 150 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
S. A. Badaev Kazakhstan 9 148 67 52 35 3 30 157
Ekaterina Fokina Austria 9 197 1.3× 32 0.5× 67 1.3× 48 1.4× 25 204
Antonín Kučera Czechia 8 191 1.3× 77 1.1× 42 0.8× 66 1.9× 16 197
Wesley Calvert United States 9 184 1.2× 32 0.5× 88 1.7× 45 1.3× 26 189
Nikolay Bazhenov Russia 8 209 1.4× 34 0.5× 48 0.9× 58 1.7× 65 221
Jan Reimann Germany 7 107 0.7× 42 0.6× 17 0.3× 41 1.2× 14 119
Xizhong Zheng Germany 6 128 0.9× 51 0.8× 29 0.6× 37 1.1× 26 138
Emil L. Post 2 154 1.0× 16 0.2× 46 0.9× 66 1.9× 2 166
Andrzej Grzesik Poland 7 127 0.9× 6 0.1× 53 1.0× 17 0.5× 25 152
David Saxton Brazil 6 140 0.9× 7 0.1× 104 2.0× 6 0.2× 10 182
Rózsa Péter Hungary 5 64 0.4× 11 0.2× 13 0.3× 40 1.1× 26 94

Countries citing papers authored by S. A. Badaev

Since Specialization
Citations

This map shows the geographic impact of S. A. Badaev's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by S. A. Badaev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. A. Badaev more than expected).

Fields of papers citing papers by S. A. Badaev

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by S. A. Badaev. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by S. A. Badaev. The network helps show where S. A. Badaev may publish in the future.

Co-authorship network of co-authors of S. A. Badaev

This figure shows the co-authorship network connecting the top 25 collaborators of S. A. Badaev. A scholar is included among the top collaborators of S. A. Badaev based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with S. A. Badaev. S. A. Badaev is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Badaev, S. A., et al.. (2023). On diagonal functions for equivalence relations. Archive for Mathematical Logic. 63(3-4). 259–278.
2.
Badaev, S. A., et al.. (2021). Special classes of positive preorders. Sibirskie Elektronnye Matematicheskie Izvestiya. 18(2). 1657–1666. 1 indexed citations
3.
Badaev, S. A., et al.. (2021). One-Element Rogers Semilattices in the Ershov Hierarchy. Algebra and Logic. 60(4). 284–287.
4.
Badaev, S. A., et al.. (2020). The Structure of Computably Enumerable Preorder Relations. Algebra and Logic. 59(3). 201–215. 3 indexed citations
5.
Badaev, S. A., et al.. (2019). ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS. Journal of Symbolic Logic. 85(1). 61–86. 8 indexed citations
6.
Badaev, S. A., et al.. (2018). Some Absolute Properties of A-Computable Numberings. Algebra and Logic. 57(4). 275–288. 2 indexed citations
7.
Badaev, S. A., et al.. (2018). UNIVERSAL POSITIVE PREORDERS. 49–53. 10 indexed citations
8.
Badaev, S. A., et al.. (2014). Friedberg numberings in the Ershov hierarchy. Archive for Mathematical Logic. 54(1-2). 59–73. 1 indexed citations
9.
Badaev, S. A., et al.. (2012). Rogers semilattices of families of two embedded sets in the Ershov hierarchy. Mathematical logic quarterly. 58(4-5). 366–376. 2 indexed citations
10.
Ambos‐Spies, Klaus, S. A. Badaev, & С. С. Гончаров. (2010). Inductive inference and computable numberings. Theoretical Computer Science. 412(18). 1652–1668. 2 indexed citations
11.
Badaev, S. A., С. С. Гончаров, & Andrea Sorbi. (2006). Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy. Algebra and Logic. 45(6). 361–370. 13 indexed citations
12.
Badaev, S. A., С. С. Гончаров, & Andrea Sorbi. (2005). Elementary Theories for Rogers Semilattices. Algebra and Logic. 44(3). 143–147. 10 indexed citations
13.
Badaev, S. A., et al.. (2005). A note on partial numberings. Mathematical logic quarterly. 51(2). 129–136. 1 indexed citations
14.
Badaev, S. A., С. С. Гончаров, & Andrea Sorbi. (2003). ELEMENTARY PROPERTIES OF ROGERS SEMILATTICES OF ARITHMETICAL NUMBERINGS. Use Siena air (University of Siena). 1–10. 1 indexed citations
15.
Badaev, S. A., et al.. (2002). Minimal Coverings in the Rogers Semilattices of∑-Computable Numberings. Siberian Mathematical Journal. 43(4). 616–622. 7 indexed citations
16.
Гончаров, С. С. & S. A. Badaev. (1998). Families with one-element Rogers semilattice. Algebra and Logic. 37(1). 21–34. 2 indexed citations
17.
Badaev, S. A.. (1993). On cardinality of semilattices of enumerations of nondiscrete families. Siberian Mathematical Journal. 34(5). 795–800. 1 indexed citations
18.
Badaev, S. A.. (1978). Positive enumerations. Siberian Mathematical Journal. 18(3). 343–352. 6 indexed citations
19.
Badaev, S. A.. (1977). Computable enumerations of families of general recursive functions. Algebra and Logic. 16(2). 83–98. 9 indexed citations
20.
Badaev, S. A.. (1975). On incomparable enumerations. Siberian Mathematical Journal. 15(4). 519–524.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Ekaterina Fokina Breakdown of academic impact, for papers by Antonín Kučera Breakdown of academic impact, for papers by Wesley Calvert Breakdown of academic impact, for papers by Nikolay Bazhenov Breakdown of academic impact, for papers by Jan Reimann Breakdown of academic impact, for papers by Xizhong Zheng Breakdown of academic impact, for papers by Emil L. Post Breakdown of academic impact, for papers by Andrzej Grzesik Breakdown of academic impact, for papers by David Saxton Breakdown of academic impact, for papers by Rózsa Péter
Rankless by CCL
2026