Concepedia
Statistics
Publications
21
Citations
638
H-Index
15
Active since
1992
Affiliations
University of Notre Dame(Current)
Victoria University of Wellington
University of California, Berkeley
University of Connecticut
University of Wisconsin–Madison
Peter Cholak is an author at University of Notre Dame specializing in engineering, computer science, and formal methods.
Top concepts
EngineeringComputer ScienceFormal MethodsAutomated ReasoningDiscrete MathematicsProof ComplexityComputational ComplexityFormal VerificationTheory Of ComputingEntropy
Publications per year
1992–2022
On the strength of Ramsey's theorem for pairs
Peter Cholak, Carl G. Jockusch, Theodore A. Slaman · Journal of Symbolic Logic · 2001 · 207 citations
Theory Of Computing, Combinatorics On Word, Effective Content +11
Automorphisms of the lattice of recursively enumerable sets
Peter Cholak · Memoirs of the American Mathematical Society · 1995 · 39 citations
Lattice (Order), Extremal Set Theory, Set-theoretic Topology +6
Computably categorical structures and expansions by constants
Peter Cholak, Bakhadyr Khoussainov, Richard A. Shore · Journal of Symbolic Logic · 1999 · 37 citations
Effective Model Theory, Effective Content, Engineering +12
THE COMPLEXITY OF LOCAL STRATIFICATION
Peter Cholak, Howard A. Blair · Fundamenta Informaticae · 1994 · 31 citations
Computational Logic, Programming Language Theory, Computational Complexity Theory +11
Strong jump-traceability I: The computably enumerable case
Peter Cholak, Rod Downey, Noam Greenberg · Advances in Mathematics · 2007 · 30 citations
Computational Complexity Theory, Engineering, Computational Model Theory +5
1–5 of 21