Boolean Algebras and Orbits of the Lattice of R.E. Sets Modulo the Finite Sets. - Peter Cholak (J. Symb. Log., 1990)

Degrees of Inferability. - Peter Cholak; Efim B. Kinber; Rodney G. Downey; Martin Kummer; Lance Fortnow; Stuart A. Kurtz; William I. Gasarch; Theodore A. Slaman (COLT, 1992)

Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees. - Peter Cholak; Rodney G. Downey (Ann. Pure Appl. Log., 1993)

On the Cantor-Bendixon Rank of Recursively Enumerable Sets. - Peter Cholak; Rodney G. Downey (J. Symb. Log., 1993)

The translation theorem. - Peter Cholak (Arch. Math. Log., 1994)

Iterated relative recursive enumerability. - Peter A. Cholak; Peter G. Hinman (Arch. Math. Log., 1994)

The Complexity of Local Stratification. - Peter Cholak; Howard A. Blair (Fundam. Informaticae, 1994)

Automorphisms of the lattice of recursively enumerable sets. - Peter Cholak (American Mathematical Society, 1995)

Intervals Without Critical Triples. - Peter Cholak; Rod Downey; Richard A. Shore (Logic Colloquium, 1995)

Permitting, Forcing, and Copying of a Given Recursive Relation. - Christopher J. Ash; Peter Cholak; Julia F. Knight (Ann. Pure Appl. Log., 1997)

The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets. - Peter Cholak (Ann. Pure Appl. Log., 1998)

Computably Categorical Structures and Expansions by Constants. - Peter Cholak; Sergei S. Goncharov; Bakhadyr Khoussainov; Richard A. Shore (J. Symb. Log., 1999)

Definable encodings in the computably enumerable sets. - Peter Cholak; Leo Harrington (Bull. Symb. Log., 2000)

Some orbits for E. - Peter Cholak; Rodney G. Downey; Eberhard Herrmann (Ann. Pure Appl. Log., 2001)

An Almost Deep Degree. - Peter Cholak; Marcia J. Groszek; Theodore A. Slaman (J. Symb. Log., 2001)

On The Strength of Ramsey's Theorem for Pairs. - Peter Cholak; Carl G. Jockusch Jr.; Theodore A. Slaman (J. Symb. Log., 2001)

On the Definability of the double jump in the computably Enumerable Sets. - Peter A. Cholak; Leo Harrington (J. Math. Log., 2002)

Maximal Contiguous Degrees. - Peter Cholak; Rodney G. Downey; Stephen Walk (J. Symb. Log., 2002)

Isomorphisms of splits of computably enumerable sets. - Peter Cholak; Leo Harrington (J. Symb. Log., 2003)

Reverse mathematics and the equivalence of definitions for well and better quasi-orders. - Peter Cholak; Alberto Marcone; Reed Solomon (J. Symb. Log., 2004)

A computably stable structure with no Scott family of finitary formulas. - Peter Cholak; Richard A. Shore; Reed Solomon (Arch. Math. Log., 2006)

Uniform almost everywhere domination. - Peter Cholak; Noam Greenberg; Joseph S. Miller (J. Symb. Log., 2006)

Introduction to the Special Issue on Vaught's Conjecture. - Peter Cholak (Notre Dame J. Formal Log., 2007)

The Complexity of Orbits of Computably Enumerable Sets. - Peter Cholak; Rodney G. Downey; Leo Harrington (Bull. Symb. Log., 2008)

Corrigendum to: "On the strength of Ramsey's Theorem for pairs". - Peter Cholak; Theodore A. Slaman; Carl G. Jockusch Jr. (J. Symb. Log., 2009)

On Mathias Generic Sets. - Peter Cholak; Damir D. Dzhafarov; Jeffry L. Hirst (CiE, 2012)

On n-tardy sets. - Peter Cholak; Peter M. Gerdes; Karen M. Lange (Ann. Pure Appl. Log., 2012)

Computably Enumerable Partial Orders. - Peter Cholak; Damir D. Dzhafarov; Noah David Schweber; Richard A. Shore (Comput., 2012)

Reverse mathematics and infinite traceable graphs. - Peter Cholak; David J. Galvin; Reed Solomon (Math. Log. Q., 2012)

Generics for computable Mathias forcing. - Peter Cholak; Damir D. Dzhafarov; Jeffry L. Hirst; Theodore A. Slaman (Ann. Pure Appl. Log., 2014)

${ cal D}$-MAXIMAL SETS. - Peter Cholak; Peter M. Gerdes; Karen M. Lange (J. Symb. Log., 2015)

Some Recent Research Directions in the Computably Enumerable Sets. - Peter A. Cholak (The Incomputable, 2017)

On Splits of Computably Enumerable Sets. - Peter A. Cholak (Computability and Complexity, 2017)

Computably enumerable sets that are automorphic to low sets. - Peter Cholak; Rachel Epstein (Comput., 2017)

Density-1-Bounding and quasiminimality in the Generic Degrees. - Peter Cholak; Gregory Igusa (J. Symb. Log., 2017)

Some results concerning the SRT22 vs. COH problem. - Peter A. Cholak; Damir D. Dzhafarov; Denis R. Hirschfeldt; Ludovic Patey (Comput., 2020)

Overcoming a Theoretical Limitation of Self-Attention. - David Chiang 001; Peter Cholak (ACL (1), 2022)

Extending properly n-REA sets. - Peter Cholak; Peter M. Gerdes (Comput., 2022)

Tighter Bounds on the Expressivity of Transformer Encoders. - David Chiang 001; Peter Cholak; Anand Pillay (ICML, 2023)