Peter Cholak

According to our database, Peter Cholak authored at least 39 papers between 1990 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Tighter Bounds on the Expressivity of Transformer Encoders.

David Chiang, Peter Cholak, Anand Pillay

Proceedings of the International Conference on Machine Learning, 2023

2022

Extending properly n-REA sets.

Peter Cholak, Peter M. Gerdes

Comput., 2022

Overcoming a Theoretical Limitation of Self-Attention.

David Chiang, Peter Cholak

Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2022

2020

Some results concerning the SRT22 vs. COH problem.

Peter A. Cholak, Damir D. Dzhafarov, Denis R. Hirschfeldt, Ludovic Patey

Comput., 2020

2017

Density-1-Bounding and quasiminimality in the Generic Degrees.

Peter Cholak, Gregory Igusa

J. Symb. Log., 2017

Computably enumerable sets that are automorphic to low sets.

Peter Cholak, Rachel Epstein

Comput., 2017

On Splits of Computably Enumerable Sets.

Peter A. Cholak

Proceedings of the Computability and Complexity, 2017

Some Recent Research Directions in the Computably Enumerable Sets.

Peter A. Cholak

Proceedings of the Incomputable: Journeys Beyond the Turing Barrier, 2017

2015

${\cal D}$-MAXIMAL SETS.

Peter Cholak, Peter M. Gerdes, Karen M. Lange

J. Symb. Log., 2015

2014

Generics for computable Mathias forcing.

Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst, Theodore A. Slaman

Ann. Pure Appl. Log., 2014

2012

Reverse mathematics and infinite traceable graphs.

Peter Cholak, David J. Galvin, Reed Solomon

Math. Log. Q., 2012

Computably Enumerable Partial Orders.

Peter Cholak, Damir D. Dzhafarov, Noah David Schweber, Richard A. Shore

Comput., 2012

On n-tardy sets.

Peter Cholak, Peter M. Gerdes, Karen M. Lange

Ann. Pure Appl. Log., 2012

On Mathias Generic Sets.

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

Proceedings of the How the World Computes, 2012

2009

Corrigendum to: "On the strength of Ramsey's Theorem for pairs".

Peter Cholak, Theodore A. Slaman, Carl G. Jockusch Jr.

J. Symb. Log., 2009

2008

The Complexity of Orbits of Computably Enumerable Sets.

Peter Cholak, Rodney G. Downey, Leo Harrington

Bull. Symb. Log., 2008

2007

Introduction to the Special Issue on Vaught's Conjecture.

Peter Cholak

Notre Dame J. Formal Log., 2007

2006

Uniform almost everywhere domination.

Peter Cholak, Noam Greenberg, Joseph S. Miller

J. Symb. Log., 2006

A computably stable structure with no Scott family of finitary formulas.

Peter Cholak, Richard A. Shore, Reed Solomon

Arch. Math. Log., 2006

2004

Reverse mathematics and the equivalence of definitions for well and better quasi-orders.

Peter Cholak, Alberto Marcone, Reed Solomon

J. Symb. Log., 2004

2003

Isomorphisms of splits of computably enumerable sets.

Peter Cholak, Leo Harrington

J. Symb. Log., 2003

2002

Maximal Contiguous Degrees.

Peter Cholak, Rodney G. Downey, Stephen Walk

J. Symb. Log., 2002

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

Peter A. Cholak, Leo Harrington

J. Math. Log., 2002

2001

On The Strength of Ramsey's Theorem for Pairs.

Peter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman

J. Symb. Log., 2001

An Almost Deep Degree.

Peter Cholak, Marcia J. Groszek, Theodore A. Slaman

J. Symb. Log., 2001

Some orbits for E.

Peter Cholak, Rodney G. Downey, Eberhard Herrmann

Ann. Pure Appl. Log., 2001

2000

Definable encodings in the computably enumerable sets.

Peter Cholak, Leo Harrington

Bull. Symb. Log., 2000

1999

Computably Categorical Structures and Expansions by Constants.

Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore

J. Symb. Log., 1999

1998

The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets.

Peter Cholak

Ann. Pure Appl. Log., 1998

1997

Permitting, Forcing, and Copying of a Given Recursive Relation.

Christopher J. Ash, Peter Cholak, Julia F. Knight

Ann. Pure Appl. Log., 1997

1995

Intervals Without Critical Triples.

Peter Cholak, Rod Downey, Richard A. Shore

Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

Automorphisms of the lattice of recursively enumerable sets.

Peter Cholak

Memoirs of the American Mathematical Society 541, American Mathematical Society, ISBN: 978-0-8218-2601-0, 1995

1994

The Complexity of Local Stratification.

Peter Cholak, Howard A. Blair

Fundam. Informaticae, 1994

Iterated relative recursive enumerability.

Peter A. Cholak, Peter G. Hinman

Arch. Math. Log., 1994

The translation theorem.

Peter Cholak

Arch. Math. Log., 1994

1993

On the Cantor-Bendixon Rank of Recursively Enumerable Sets.

Peter Cholak, Rodney G. Downey

J. Symb. Log., 1993

Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees.

Peter Cholak, Rodney G. Downey

Ann. Pure Appl. Log., 1993

1992

Degrees of Inferability.

Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1990

Boolean Algebras and Orbits of the Lattice of R.E. Sets Modulo the Finite Sets.

Peter Cholak

J. Symb. Log., 1990