Peter G. Hinman

590 total citations
17 papers, 273 citations indexed

About

Peter G. Hinman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Peter G. Hinman has authored 17 papers receiving a total of 273 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 6 papers in Artificial Intelligence and 4 papers in Geometry and Topology. Recurrent topics in Peter G. Hinman's work include Computability, Logic, AI Algorithms (9 papers), semigroups and automata theory (5 papers) and Advanced Topology and Set Theory (4 papers). Peter G. Hinman is often cited by papers focused on Computability, Logic, AI Algorithms (9 papers), semigroups and automata theory (5 papers) and Advanced Topology and Set Theory (4 papers). Peter G. Hinman collaborates with scholars based in United States and Norway. Peter G. Hinman's co-authors include Douglas Cenzer, Stephen P. Stich, Theodore A. Slaman, Jaegwon Kim and Peter Cholak and has published in prestigious journals such as Transactions of the American Mathematical Society, The Journal of Philosophy and Journal of Symbolic Logic.

In The Last Decade

Peter G. Hinman

15 papers receiving 233 citations

Peers

Peter G. Hinman
R. E. Vesley United States
R. O. Gandy United Kingdom
D. van Dalen Netherlands
J. W. Addison United States
Philip Ehrlich United States
Gerhard Jäger Switzerland
Thomas Strahm Switzerland
R. E. Vesley United States
Peter G. Hinman
Citations per year, relative to Peter G. Hinman Peter G. Hinman (= 1×) peers R. E. Vesley

Countries citing papers authored by Peter G. Hinman

Since Specialization
Citations

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

Fields of papers citing papers by Peter G. Hinman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Peter G. Hinman

This figure shows the co-authorship network connecting the top 25 collaborators of Peter G. Hinman. A scholar is included among the top collaborators of Peter G. Hinman 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 Peter G. Hinman. Peter G. Hinman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

17 of 17 papers shown
1.
Hinman, Peter G.. (2018). Fundamentals of Mathematical Logic. 6 indexed citations
2.
Hinman, Peter G.. (2017). Recursion-Theoretic Hierarchies. Cambridge University Press eBooks. 1 indexed citations
3.
Hinman, Peter G.. (2012). A Survey of Mučnik and Medvedev Degrees. Bulletin of Symbolic Logic. 18(2). 161–229. 5 indexed citations
4.
Cenzer, Douglas & Peter G. Hinman. (2007). Degrees of difficulty of generalized r.e. separating classes. Archive for Mathematical Logic. 46(7-8). 629–647. 8 indexed citations
5.
Cenzer, Douglas & Peter G. Hinman. (2003). Density of the Medvedev lattice of ?01 classes. Archive for Mathematical Logic. 42(6). 583–600. 20 indexed citations
7.
Cholak, Peter & Peter G. Hinman. (1994). Iterated relative recursive enumerability. Archive for Mathematical Logic. 33(5). 321–346. 2 indexed citations
8.
Hinman, Peter G. & Theodore A. Slaman. (1991). Jump embeddings in the Turing degrees. Journal of Symbolic Logic. 56(2). 563–591. 5 indexed citations
10.
Hinman, Peter G.. (1978). Recursion-Theoretic Hierarchies. 176 indexed citations
11.
Hinman, Peter G.. (1973). The finite levels of the hierarchy of effective R-sets. Fundamenta Mathematicae. 79(1). 1–10. 3 indexed citations
12.
Hinman, Peter G.. (1973). Degrees of continuous functionals. Journal of Symbolic Logic. 38(3). 393–395. 2 indexed citations
13.
Hinman, Peter G.. (1972). Finite termination games with tie. Israel Journal of Mathematics. 12(1). 17–22. 1 indexed citations
14.
Hinman, Peter G.. (1969). Hierarchies of Effective Descriptive Set Theory. Transactions of the American Mathematical Society. 142. 111–111. 2 indexed citations
15.
Hinman, Peter G.. (1969). Hierarchies of effective descriptive set theory. Transactions of the American Mathematical Society. 142(0). 111–140. 9 indexed citations
16.
Hinman, Peter G.. (1969). Some applications of forcing to hierarchy problems in arithmetic. Mathematical logic quarterly. 15(20-22). 341–352. 24 indexed citations
17.
Hinman, Peter G., Jaegwon Kim, & Stephen P. Stich. (1968). Logical Truth Revisited. The Journal of Philosophy. 65(17). 495–495. 8 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