Peter Cholak

821 total citations
45 papers, 367 citations indexed

About

Peter Cholak is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Peter Cholak has authored 45 papers receiving a total of 367 indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Computational Theory and Mathematics, 21 papers in Geometry and Topology and 12 papers in Artificial Intelligence. Recurrent topics in Peter Cholak's work include Computability, Logic, AI Algorithms (39 papers), semigroups and automata theory (24 papers) and Advanced Topology and Set Theory (21 papers). Peter Cholak is often cited by papers focused on Computability, Logic, AI Algorithms (39 papers), semigroups and automata theory (24 papers) and Advanced Topology and Set Theory (21 papers). Peter Cholak collaborates with scholars based in United States, New Zealand and Germany. Peter Cholak's co-authors include Theodore A. Slaman, Carl G. Jockusch, Rod Downey, Leo Harrington, Noam Greenberg, David Chiang, Howard A. Blair, Reed Solomon, Joseph S. Miller and Alberto Marcone and has published in prestigious journals such as Transactions of the American Mathematical Society, Advances in Mathematics and Journal of the American Mathematical Society.

In The Last Decade

Peter Cholak

43 papers receiving 340 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Peter Cholak United States 12 336 147 91 64 28 45 367
Andreas Weiermann Belgium 10 345 1.0× 137 0.9× 171 1.9× 40 0.6× 38 1.4× 69 419
Alberto Marcone Italy 9 184 0.5× 111 0.8× 53 0.6× 25 0.4× 51 1.8× 32 218
Klaus Ambos‐Spies Germany 13 490 1.5× 89 0.6× 213 2.3× 72 1.1× 10 0.4× 54 502
Victor Selivanov Russia 11 397 1.2× 176 1.2× 128 1.4× 17 0.3× 41 1.5× 79 441
Douglas Cenzer United States 11 368 1.1× 145 1.0× 107 1.2× 50 0.8× 49 1.8× 67 428
Arno Pauly United Kingdom 11 257 0.8× 95 0.6× 115 1.3× 31 0.5× 40 1.4× 48 295
Manuel Lerman United States 14 606 1.8× 289 2.0× 181 2.0× 74 1.2× 70 2.5× 52 651
Stanley S. Wainer United Kingdom 9 207 0.6× 57 0.4× 132 1.5× 16 0.3× 29 1.0× 21 242
Jerome Malitz United States 10 182 0.5× 130 0.9× 98 1.1× 13 0.2× 65 2.3× 19 287
Robert Bonnet France 6 201 0.6× 147 1.0× 57 0.6× 9 0.1× 68 2.4× 23 291

Countries citing papers authored by Peter Cholak

Since Specialization
Citations

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

Fields of papers citing papers by Peter Cholak

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Peter Cholak

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Cholak. A scholar is included among the top collaborators of Peter Cholak 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 Cholak. Peter Cholak 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.
Cholak, Peter, et al.. (2020). Some results concerning the SRT 2 2 vs. COH problem. arXiv (Cornell University). 9(3-4). 193–217. 1 indexed citations
2.
Cholak, Peter, et al.. (2016). Any FIP real computes a 1-generic. Transactions of the American Mathematical Society. 369(8). 5855–5869. 1 indexed citations
3.
Cholak, Peter, Rodney G. Downey, & Leo Harrington. (2008). On the orbits of computably enumerable sets. Journal of the American Mathematical Society. 21(4). 1105–1135. 1 indexed citations
4.
Cholak, Peter. (2007). Introduction to the Special Issue on Vaught's Conjecture. Notre Dame Journal of Formal Logic. 48(1).
5.
Cholak, Peter & Leo Harrington. (2007). Extension theorems, orbits, and automorphisms of the computably enumerable sets. Transactions of the American Mathematical Society. 360(4). 1759–1791. 2 indexed citations
6.
Cholak, Peter, Rod Downey, & Noam Greenberg. (2007). Strong jump-traceability I: The computably enumerable case. Advances in Mathematics. 217(5). 2045–2074. 20 indexed citations
7.
Cholak, Peter, Rod Downey, & Leo Harrington. (2006). On the Orbits of Computable Enumerable Sets. 3 indexed citations
8.
Cholak, Peter, Alberto Marcone, & Reed Solomon. (2004). Reverse mathematics and the equivalence of definitions for well and better quasi-orders. Journal of Symbolic Logic. 69(3). 683–712. 19 indexed citations
9.
Cholak, Peter & Leo Harrington. (2003). Isomorphisms of splits of computably enumerable sets. Journal of Symbolic Logic. 68(3). 1044–1064. 4 indexed citations
10.
Cholak, Peter, et al.. (2002). Maximal contiguous degrees. Journal of Symbolic Logic. 67(1). 409–437. 1 indexed citations
11.
Cholak, Peter, et al.. (2001). Some orbits for E. Annals of Pure and Applied Logic. 107(1-3). 193–226. 4 indexed citations
14.
Cholak, Peter & André Nies. (1999). Atomlessr-maximal sets. Israel Journal of Mathematics. 113(1). 305–322. 1 indexed citations
15.
Cholak, Peter. (1995). Automorphisms of the lattice of recursively enumerable sets. Memoirs of the American Mathematical Society. 113(541). 0–0. 20 indexed citations
16.
Cholak, Peter & Rod Downey. (1993). Lattice nonembeddings and intervals of the recursively enumerable degrees. Annals of Pure and Applied Logic. 61(3). 195–221. 2 indexed citations
17.
Cholak, Peter & Rod Downey. (1993). On the Cantor-Bendixon rank of recursively enumerable sets. Journal of Symbolic Logic. 58(2). 629–640. 4 indexed citations
18.
Cholak, Peter, Rodney G. Downey, & Michael Stob. (1992). Automorphisms of the lattice of recursively enumerable sets: promptly simple sets. Transactions of the American Mathematical Society. 332(2). 555–570. 12 indexed citations
19.
Cholak, Peter, Rod Downey, & Michael Stob. (1992). Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets. Transactions of the American Mathematical Society. 332(2). 555–555. 6 indexed citations
20.
Cholak, Peter. (1990). Boolean algebras and orbits of the lattice of r.e sets modulo the finite sets. Journal of Symbolic Logic. 55(2). 744–760. 1 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