Robert I. Soare

6.3k total citations · 2 hit papers
73 papers, 3.3k citations indexed

About

Robert I. Soare is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Robert I. Soare has authored 73 papers receiving a total of 3.3k indexed citations (citations by other indexed papers that have themselves been cited), including 65 papers in Computational Theory and Mathematics, 30 papers in Geometry and Topology and 13 papers in Artificial Intelligence. Recurrent topics in Robert I. Soare's work include Computability, Logic, AI Algorithms (60 papers), semigroups and automata theory (36 papers) and Advanced Topology and Set Theory (30 papers). Robert I. Soare is often cited by papers focused on Computability, Logic, AI Algorithms (60 papers), semigroups and automata theory (36 papers) and Advanced Topology and Set Theory (30 papers). Robert I. Soare collaborates with scholars based in United States, Canada and Germany. Robert I. Soare's co-authors include Carl G. Jockusch, Manuel Lerman, Leo Harrington, A. H. Lachlan, Richard A. Shore, Klaus Ambos‐Spies, Steffen Lempp, S. Barry Cooper, Theodore A. Slaman and Denis R. Hirschfeldt and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Annals of Mathematics and Lecture notes in mathematics.

In The Last Decade

Robert I. Soare

69 papers receiving 2.9k citations

Hit Papers

Recursively enumerable sets and degrees 1978 2026 1994 2010 1978 1987 250 500 750

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Robert I. Soare United States 24 3.1k 1.1k 969 517 243 73 3.3k
Hartley Rogers United States 10 1.8k 0.6× 430 0.4× 1.1k 1.1× 132 0.3× 164 0.7× 26 2.2k
Douglas Bridges New Zealand 16 1.1k 0.3× 553 0.5× 534 0.6× 81 0.2× 419 1.7× 144 1.6k
Errett Bishop United States 21 926 0.3× 775 0.7× 371 0.4× 137 0.3× 893 3.7× 39 2.4k
Robert M Solovay United States 13 1.1k 0.4× 671 0.6× 616 0.6× 31 0.1× 365 1.5× 28 1.5k
J. B. Paris United Kingdom 19 744 0.2× 216 0.2× 911 0.9× 81 0.2× 164 0.7× 90 1.4k
Fred Richman United States 22 771 0.2× 653 0.6× 338 0.3× 58 0.1× 390 1.6× 120 1.7k
Yiannis N. Moschovakis United States 18 747 0.2× 360 0.3× 439 0.5× 33 0.1× 169 0.7× 53 994
John Myhill United States 16 849 0.3× 221 0.2× 536 0.6× 48 0.1× 180 0.7× 40 1.2k
Per Martin-Löf Sweden 10 1.2k 0.4× 110 0.1× 1.2k 1.3× 174 0.3× 176 0.7× 18 1.8k
Horst Herrlich Germany 22 1.4k 0.4× 1.2k 1.2× 558 0.6× 44 0.1× 1.2k 4.8× 125 3.0k

Countries citing papers authored by Robert I. Soare

Since Specialization
Citations

This map shows the geographic impact of Robert I. Soare'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 Robert I. Soare with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert I. Soare more than expected).

Fields of papers citing papers by Robert I. Soare

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Robert I. Soare. 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 Robert I. Soare. The network helps show where Robert I. Soare may publish in the future.

Co-authorship network of co-authors of Robert I. Soare

This figure shows the co-authorship network connecting the top 25 collaborators of Robert I. Soare. A scholar is included among the top collaborators of Robert I. Soare 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 Robert I. Soare. Robert I. Soare 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.
Soare, Robert I.. (2016). Turing Computability: Theory and Applications. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 27 indexed citations
2.
Soare, Robert I.. (2009). Turing oracle machines, online computing, and three displacements in computability theory. Annals of Pure and Applied Logic. 160(3). 368–399. 39 indexed citations
3.
Soare, Robert I.. (2004). Computability Theory and Differential Geometry. Bulletin of Symbolic Logic. 10(4). 457–486. 22 indexed citations
4.
Hirschfeldt, Denis R., et al.. (2004). Bounding prime models. Journal of Symbolic Logic. 69(4). 1117–1142. 18 indexed citations
5.
Harrington, Leo & Robert I. Soare. (1998). Definable properties of the computably enumerable sets. Annals of Pure and Applied Logic. 94(1-3). 97–125. 3 indexed citations
6.
Ambos‐Spies, Klaus, A. H. Lachlan, & Robert I. Soare. (1993). The continuity of cupping to 0'. Annals of Pure and Applied Logic. 64(3). 195–209. 8 indexed citations
7.
Jockusch, Carl G. & Robert I. Soare. (1991). Degrees of orderings not isomorphic to recursive linear orderings. Annals of Pure and Applied Logic. 52(1-2). 39–64. 40 indexed citations
8.
Cooper, S. Barry, Leo Harrington, A. H. Lachlan, Steffen Lempp, & Robert I. Soare. (1991). The d.r.e. degrees are not dense. Annals of Pure and Applied Logic. 55(2). 125–151. 37 indexed citations
9.
Cenzer, Douglas, et al.. (1986). Members of countable π10 classes. Annals of Pure and Applied Logic. 31. 145–163. 19 indexed citations
10.
Ambos‐Spies, Klaus, Carl G. Jockusch, Richard A. Shore, & Robert I. Soare. (1984). An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees. Transactions of the American Mathematical Society. 281(1). 109–128. 51 indexed citations
11.
Soare, Robert I.. (1982). Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets. Annals of Mathematical Logic. 22(1). 69–107. 23 indexed citations
12.
Soare, Robert I.. (1982). Computational complexity of recursively enumerable sets. Information and Control. 52(1). 8–18. 12 indexed citations
13.
Soare, Robert I., et al.. (1980). A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets. Transactions of the American Mathematical Society. 257(1). 1–1. 2 indexed citations
14.
Lachlan, A. H. & Robert I. Soare. (1980). Not every finite lattice is embeddable in the recursively enumerable degrees. Advances in Mathematics. 37(1). 74–82. 24 indexed citations
15.
Soare, Robert I., et al.. (1978). Some lowness properties and computational complexity sequences. Theoretical Computer Science. 6(3). 233–254. 11 indexed citations
16.
Lerman, Manuel, Richard A. Shore, & Robert I. Soare. (1978). r-Maximal major subsets. Israel Journal of Mathematics. 31(1). 1–18. 16 indexed citations
17.
Jockusch, Carl G. & Robert I. Soare. (1973). Post's problem and his hypersimple set. Journal of Symbolic Logic. 38(3). 446–452. 9 indexed citations
18.
Jockusch, Carl G. & Robert I. Soare. (1972). Π⁰₁ classes and degrees of theories. Transactions of the American Mathematical Society. 173(0). 33–56. 204 indexed citations
19.
Jockusch, Carl G. & Robert I. Soare. (1970). Minimal covers and arithmetical sets. Proceedings of the American Mathematical Society. 25(4). 856–859. 20 indexed citations
20.
Soare, Robert I.. (1969). Sets with no subset of higher degree. Journal of Symbolic Logic. 34(1). 53–56. 17 indexed citations

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

Rankless by CCL
2026