Peter A. Cholak

发表

Extending Properly n-REA Sets

Peter M. Gerdes, Peter A. Cholak, 2021 .

Review: Stephen G. Simpson, Subsystems of Second Order Arithmetic

Peter A. Cholak, 1999, Journal of Symbolic Logic.

A definable relation between c.e. sets and ideals

Peter A. Cholak, Rebecca Weber, 2004 .

On the Orbits of Computable Enumerable Sets

Peter A. Cholak, R. Downey, L. Harrington, 2006 .

Invariance and Noninvariance in the Lattice of Π00 Classes

Peter A. Cholak, R. Downey, 2004 .

Extension theorems, orbits, and automorphisms of the computably enumerable sets

Peter A. Cholak, L. Harrington, 2004, math/0408279.

STRONG JUMP-TRACEABILITY I : THE COMPUTABLY ENUMERABLE CASE

Peter A. Cholak, R. Downey, Noam Greenberg, 2008 .

Automorphisms of the lattice of Π₁⁰ classes; perfect thin classes and anc degrees

Peter A. Cholak, R. Downey, R. Coles, 2001 .

The Rado path decomposition theorem

Peter A. Cholak, Gregory Igusa, Ludovic Patey, 2016, Israel Journal of Mathematics.

FREE SETS AND REVERSE MATHEMATICS

Peter A. Cholak, 2003 .

Genericity for Mathias forcing over general Turing ideals

Damir D. Dzhafarov, Peter A. Cholak, Mariya I. Soskova, 2015, 1505.02226.

The global structure of computably enumerable sets

Peter A. Cholak, 1993 .

Algorithmically Random Closed Sets and Probability Algorithmically Random Closed Sets and Probability

Logan M. Axon, Peter A. Cholak, 2022 .

D-MAXIMAL SETS

Peter M. Gerdes, Peter A. Cholak, 2014 .

$\mathcal{D}$-maximal sets

Peter M. Gerdes, Peter A. Cholak, K. Lange, 2014, 1401.1266.

On the orbits of computably enumerable sets

Peter A. Cholak, R. Downey, R. Downey, 2006, 0705.0125.

Ju l 2 00 6 ON THE ORBITS OF COMPUTABLE ENUMERABLE SETS

Peter A. Cholak, R. Downey, L. Harrington, 2006 .

Review of Peter Cholak, “Automorphisms of the Lattice of Recursively Enumerable Sets ” Memoirs of the American Math. Soc. (1995) viii+151 pp and

Peter A. Cholak, R. Soare, L. Harrington, 2005 .

THE COMPUTABLY ENUMERABLE SETS : RECENT RESULTS AND FUTURE DIRECTIONS

Peter A. Cholak, 2004 .

Permutations and presentations

Peter A. Cholak, R. Downey, 1994 .

Some results concerning the $\mathsf{SRT}^2_2$ vs. $\mathsf{COH}$ problem

Denis R. Hirschfeldt, Peter A. Cholak, D. Dzhafarov, 2019, 1901.10326.

Thin set theorems and cone avoidance

Peter A. Cholak, Ludovic Patey, 2018, 1812.00188.

Automorphisms of the lattice of Π₁⁰ classes; perfect thin classes and anc degrees

Peter A. Cholak, R. Downey, R. Coles, 2001 .

LECTURES ON EFFECTIVE RANDOMNESS

Peter A. Cholak, 2006 .

Extension theorems, orbits, and automorphisms of the computably enumerable sets

Peter A. Cholak, L. Harrington, 2004, math/0408279.

Extending Properly n-REA Sets

Peter M. Gerdes, Peter A. Cholak, 2021, 2107.01299.

Reverse Mathematics of Combinatorial Principles (19w5111)

Peter A. Cholak, 2020 .

Computably Enumerable Partial Orders

Peter A. Cholak, R. Shore, D. Dzhafarov, 2011, Comput..

Cdmtcs Research Report Series Computably Categorical Structures and Expansions by Constants Computably Categorical Structures and Expansions by Constants

Peter A. Cholak, Sergey Goncharovy, Bakhadyr Khoussainovz, 1996 .

Tighter Bounds on the Expressivity of Transformer Encoders

Peter A. Cholak, A. Pillay, Cheng-Han Chiang, 2023, ArXiv.

Milliken's tree theorem and its applications: a computability-theoretic perspective

Peter A. Cholak, B. Monin, D. Dzhafarov, 2020, 2007.09739.

Overcoming a Theoretical Limitation of Self-Attention

Peter A. Cholak, David Chiang, 2022, ACL.

Tighter Bounds on the Expressivity of Transformer Encoders

Peter A. Cholak, A. Pillay, David Chiang, 2023, arXiv.org.

Uniform almost everywhere domination

Joseph S. Miller, Noam Greenberg, Peter Cholak, 2005, Journal of Symbolic Logic.

Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees

Peter Cholak, Rod Downey, Peter A. Cholak, 1993, Ann. Pure Appl. Log..

Genericity for Mathias forcing over general Turing ideals

Peter A. Cholak, D. Dzhafarov, M. Soskova, 2016, Israel Journal of Mathematics.

Corrigendum to: “On the strength of Ramsey's Theorem for pairs”

Carl G. Jockusch, Theodore A. Slaman, Peter Cholak, 2009, The Journal of Symbolic Logic.

On the strength of Ramsey's theorem for pairs

Carl G. Jockusch, Theodore A. Slaman, Peter Cholak, 2001, Journal of Symbolic Logic.

1998–1999 Winter Meeting of the Association for Symbolic Logic

Peter Cholak, Peter A. Cholak, 1999, Bulletin of Symbolic Logic.

Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective

Peter A. Cholak, B. Monin, D. Dzhafarov, 2020, Memoirs of the American Mathematical Society.

Degrees of inferability

Stuart A. Kurtz, Lance Fortnow, Efim B. Kinber, 1992, COLT '92.

On Mathias Generic Sets

Jeffry L. Hirst, Damir D. Dzhafarov, Peter Cholak, 2012, CiE.

Computably categorical structures and expansions by constants

Richard A. Shore, Bakhadyr Khoussainov, Peter Cholak, 1999, Journal of Symbolic Logic.

${\cal D}$-MAXIMAL SETS

Peter Cholak, Karen Lange, Peter M. Gerdes, 2015, The Journal of Symbolic Logic.

Some Recent Research Directions in the Computably Enumerable Sets

Peter A. Cholak, Peter A. Cholak, 2013, The Incomputable.

The Complexity of Orbits of Computably Enumerable Sets

Peter A. Cholak, R. Downey, L. Harrington, 2007, Bulletin of Symbolic Logic.

On the Definability of the double jump in the computably Enumerable Sets

Leo Harrington, Peter A. Cholak, Peter A. Cholak, 2002, J. Math. Log..

Some orbits for E

Rodney G. Downey, Peter Cholak, Eberhard Herrmann, 2001, Ann. Pure Appl. Log..

Definable Encodings in the Computably Enumerable Sets

Leo Harrington, Peter Cholak, Peter A. Cholak, 2000, Bulletin of Symbolic Logic.

Automorphisms of the lattice of recursively enumerable sets: promptly simple sets

Michael Stob, Peter Cholak, Rod Downey, 1992 .

Some results concerning the SRT22 vs. COH problem

Denis R. Hirschfeldt, Ludovic Patey, Damir D. Dzhafarov, 2020, Comput..

Generics for computable Mathias forcing

Jeffry L. Hirst, Theodore A. Slaman, Damir D. Dzhafarov, 2014, Ann. Pure Appl. Log..