Hartley Rogers

3.6k total citations · 1 hit paper
26 papers, 2.2k citations indexed

About

Hartley Rogers is a scholar working on Computational Theory and Mathematics, Mathematical Physics and Artificial Intelligence. According to data from OpenAlex, Hartley Rogers has authored 26 papers receiving a total of 2.2k indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 5 papers in Mathematical Physics and 5 papers in Artificial Intelligence. Recurrent topics in Hartley Rogers's work include Computability, Logic, AI Algorithms (8 papers), Advanced Algebra and Logic (4 papers) and Mathematical and Theoretical Analysis (4 papers). Hartley Rogers is often cited by papers focused on Computability, Logic, AI Algorithms (8 papers), Advanced Algebra and Logic (4 papers) and Mathematical and Theoretical Analysis (4 papers). Hartley Rogers collaborates with scholars based in United States. Hartley Rogers's co-authors include Solomon Feferman, R. Friedberg, A. R. D. Mathias, Ernest Nagel, James R. Newman and Robert L. Vaught and has published in prestigious journals such as Annals of Mathematics, Lecture notes in mathematics and Transactions of the American Mathematical Society.

In The Last Decade

Hartley Rogers

22 papers receiving 1.7k citations

Hit Papers

Theory of Recursive Functions and Effective Computability. 1969 2026 1988 2007 1969 500 1000 1.5k

Peers

Hartley Rogers
John Myhill United States
J. C. Shepherdson United Kingdom
Robert I. Soare United States
J. R. Shoenfield United States
Calvin C. Elgot United States
Douglas Bridges New Zealand
Robert M Solovay United States
John Myhill United States
Hartley Rogers
Citations per year, relative to Hartley Rogers Hartley Rogers (= 1×) peers John Myhill

Countries citing papers authored by Hartley Rogers

Since Specialization
Citations

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

Fields of papers citing papers by Hartley Rogers

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Hartley Rogers

This figure shows the co-authorship network connecting the top 25 collaborators of Hartley Rogers. A scholar is included among the top collaborators of Hartley Rogers 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 Hartley Rogers. Hartley Rogers 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.
Rogers, Hartley. (1998). Multivariable calculus with vectors. Medical Entomology and Zoology. 2 indexed citations
2.
Vaught, Robert L., A. R. D. Mathias, & Hartley Rogers. (1982). Descriptive Set Theory in L ω 1 ω. 9 indexed citations
3.
Mathias, A. R. D. & Hartley Rogers. (1973). Cambridge Summer School in Mathematical Logic. Lecture notes in mathematics. 67 indexed citations
4.
Feferman, Solomon & Hartley Rogers. (1969). Theory of Recursive Functions and Effective Computability.. American Mathematical Monthly. 76(6). 715–715. 1748 indexed citations breakdown →
5.
Rogers, Hartley. (1965). On universal functions. Proceedings of the American Mathematical Society. 16(1). 39–44. 3 indexed citations
6.
Rogers, Hartley. (1964). Information Theory. Mathematics Magazine. 37(2). 63–78. 1 indexed citations
7.
Rogers, Hartley. (1963). An Example in Mathematical Logic. American Mathematical Monthly. 70(9). 929–929. 2 indexed citations
8.
Rogers, Hartley, et al.. (1961). Constructive Versions of Ordinal Number Classes. Transactions of the American Mathematical Society. 100(2). 325–325. 9 indexed citations
9.
Rogers, Hartley, et al.. (1961). Introduction to Symbolic Logic.. American Mathematical Monthly. 68(10). 1020–1020. 6 indexed citations
10.
Rogers, Hartley, et al.. (1961). Constructive versions of ordinal number classes. Transactions of the American Mathematical Society. 100(2). 325–369. 10 indexed citations
11.
Rogers, Hartley, Ernest Nagel, & James R. Newman. (1960). Godel's Proof.. American Mathematical Monthly. 67(1). 98–98. 13 indexed citations
12.
Rogers, Hartley. (1959). Recursive functions over well ordered partial orderings. Proceedings of the American Mathematical Society. 10(6). 847–853. 5 indexed citations
13.
Rogers, Hartley. (1959). Recursive Functions Over Well Ordered Partial Orderings. Proceedings of the American Mathematical Society. 10(6). 847–847. 5 indexed citations
14.
Friedberg, R. & Hartley Rogers. (1959). Reducibility and Completeness for Sets of Integers. Mathematical logic quarterly. 5(7-13). 117–125. 77 indexed citations
15.
Rogers, Hartley. (1959). Computing degrees of unsolvability. Mathematische Annalen. 138(2). 125–140. 26 indexed citations
16.
Rogers, Hartley. (1958). Gödel numberings of partial recursive functions. Journal of Symbolic Logic. 23(3). 331–341. 156 indexed citations
18.
Rogers, Hartley. (1957). A note on the law of large numbers. Proceedings of the American Mathematical Society. 8(3). 518–520. 4 indexed citations
19.
Rogers, Hartley. (1956). Certain Logical Reduction and Decision Problems. Annals of Mathematics. 64(2). 264–264. 23 indexed citations
20.
Rogers, Hartley. (1956). A General Education Course in Pure Mathematics. American Mathematical Monthly. 63(7). 460–465.

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