Peter Cholak - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2023

Tighter Bounds on the Expressivity of Transformer EncodersDavid Chiang 0001, Peter Cholak, Anand Pillay. icml 2023: 5544-5562 [doi]

2022

Overcoming a Theoretical Limitation of Self-AttentionDavid Chiang 0001, Peter Cholak. acl 2022: 7654-7664 [doi]

Extending properly n-REA setsPeter Cholak, Peter M. Gerdes. computability, 11(3-4):241-267, 2022. [doi]

2017

Computably enumerable sets that are automorphic to low setsPeter Cholak, Rachel Epstein. computability, 6(1):23-45, 2017. [doi]

Density-1-Bounding and quasiminimality in the Generic DegreesPeter Cholak, Gregory Igusa. JSYML, 82(3):931-957, 2017. [doi]

2015

${\cal D}$-MAXIMAL SETSPeter Cholak, Peter M. Gerdes, Karen Lange. JSYML, 80(4):1182-1210, 2015. [doi]

2014

Generics for computable Mathias forcingPeter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst, Theodore A. Slaman. APAL, 165(9):1418-1428, 2014. [doi]

2012

Reverse mathematics and infinite traceable graphsPeter Cholak, David Galvin, Reed Solomon. mlq, 58(1-2):18-28, 2012. [doi]

On n-tardy setsPeter Cholak, Peter M. Gerdes, Karen Lange. APAL, 163(9):1252-1270, 2012. [doi]

On Mathias Generic SetsPeter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst. CiE 2012: 129-138 [doi]

Computably Enumerable Partial OrdersPeter Cholak, Damir D. Dzhafarov, Noah Schweber, Richard A. Shore. computability, 1(2):99-107, 2012. [doi]

2008

The Complexity of Orbits of Computably Enumerable SetsPeter Cholak, Rodney G. Downey, Leo Harrington. bsl, 14(1):69-87, 2008. [doi]

2007

Introduction to the Special Issue on Vaught s ConjecturePeter Cholak. ndjfl, 48(1):1-2, 2007. [doi]

2006

A computably stable structure with no Scott family of finitary formulasPeter Cholak, Richard A. Shore, Reed Solomon. AML, 45(5):519-538, 2006. [doi]

Uniform almost everywhere dominationPeter Cholak, Noam Greenberg, Joseph S. Miller. JSYML, 71(3):1057-1072, 2006. [doi]

2004

Reverse mathematics and the equivalence of definitions for well and better quasi-ordersPeter Cholak, Alberto Marcone, Reed Solomon. JSYML, 69(3):683-712, 2004. [doi]

2003

Isomorphisms of splits of computably enumerable setsPeter Cholak, Leo Harrington. JSYML, 68(3):1044-1064, 2003.

2002

Maximal Contiguous DegreesPeter Cholak, Rodney G. Downey, Stephen Walk. JSYML, 67(1):409-437, 2002.

2001

An Almost Deep DegreePeter Cholak, Marcia J. Groszek, Theodore A. Slaman. JSYML, 66(2):881-901, 2001.

Some orbits for EPeter Cholak, Rodney G. Downey, Eberhard Herrmann. APAL, 107(1-3):193-226, 2001.

On The Strength of Ramsey s Theorem for PairsPeter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman. JSYML, 66(1):1-55, 2001.

2000

Definable encodings in the computably enumerable setsPeter Cholak, Leo Harrington. bsl, 6(2):185-196, 2000. [doi]

1999

Computably Categorical Structures and Expansions by ConstantsPeter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore. JSYML, 64(1):13-37, 1999.

1998

The Dense Simple Sets are Orbit Complete with Respect to the Simple SetsPeter Cholak. APAL, 94(1-3):37-44, 1998.

1997

Permitting, Forcing, and Copying of a Given Recursive RelationChristopher J. Ash, Peter Cholak, Julia F. Knight. APAL, 86(3):219-236, 1997.

1995

Automorphisms of the lattice of recursively enumerable setsPeter Cholak. Volume 541 of Memoirs of the American Mathematical Society, American Mathematical Society, 1995.

Intervals Without Critical TriplesPeter Cholak, Rod Downey, Richard A. Shore. logicColl 1998: 17-43 [doi]

1994

The Complexity of Local StratificationPeter Cholak, Howard A. Blair. FUIN, 21(4):333-344, 1994.

The translation theoremPeter Cholak. AML, 33(2):87-108, 1994. [doi]

1993

Lattice Nonembeddings and Intervals of the Recursively Enumerable DegreesPeter Cholak, Rodney G. Downey. APAL, 61(3):195-221, 1993.

On the Cantor-Bendixon Rank of Recursively Enumerable SetsPeter Cholak, Rodney G. Downey. JSYML, 58(2):629-640, 1993.

1992

Degrees of InferabilityPeter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman. colt 1992: 180-192 [doi]

1990

Boolean Algebras and Orbits of the Lattice of R.E. Sets Modulo the Finite SetsPeter Cholak. JSYML, 55(2):744-760, 1990.

Sign in or sign up to see more results.

runs on WebDSL