default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Cholak
Person information
- affiliation: University of Notre Dame, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c6]David Chiang, Peter Cholak, Anand Pillay:
Tighter Bounds on the Expressivity of Transformer Encoders. ICML 2023: 5544-5562- [i2]David Chiang, Peter Cholak, Anand Pillay:
Tighter Bounds on the Expressivity of Transformer Encoders. CoRR abs/2301.10743 (2023) - 2022
- [j31]Peter Cholak, Peter M. Gerdes:
Extending properly n-REA sets. Comput. 11(3-4): 241-267 (2022) - [c5]David Chiang, Peter Cholak:
Overcoming a Theoretical Limitation of Self-Attention. ACL (1) 2022: 7654-7664 - [i1]David Chiang, Peter Cholak:
Overcoming a Theoretical Limitation of Self-Attention. CoRR abs/2202.12172 (2022) - 2020
- [j30]Peter A. Cholak, Damir D. Dzhafarov, Denis R. Hirschfeldt, Ludovic Patey:
Some results concerning the SRT22 vs. COH problem. Comput. 9(3-4): 193-217 (2020)
2010 – 2019
- 2017
- [j29]Peter Cholak, Rachel Epstein:
Computably enumerable sets that are automorphic to low sets. Comput. 6(1): 23-45 (2017) - [j28]Peter Cholak, Gregory Igusa:
Density-1-Bounding and quasiminimality in the Generic Degrees. J. Symb. Log. 82(3): 931-957 (2017) - [c4]Peter A. Cholak:
On Splits of Computably Enumerable Sets. Computability and Complexity 2017: 521-535 - [p1]Peter A. Cholak:
Some Recent Research Directions in the Computably Enumerable Sets. The Incomputable 2017: 83-93 - 2015
- [j27]Peter Cholak, Peter M. Gerdes, Karen M. Lange:
${\cal D}$-MAXIMAL SETS. J. Symb. Log. 80(4): 1182-1210 (2015) - 2014
- [j26]Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst, Theodore A. Slaman:
Generics for computable Mathias forcing. Ann. Pure Appl. Log. 165(9): 1418-1428 (2014) - 2012
- [j25]Peter Cholak, Peter M. Gerdes, Karen M. Lange:
On n-tardy sets. Ann. Pure Appl. Log. 163(9): 1252-1270 (2012) - [j24]Peter Cholak, Damir D. Dzhafarov, Noah David Schweber, Richard A. Shore:
Computably Enumerable Partial Orders. Comput. 1(2): 99-107 (2012) - [j23]Peter Cholak, David J. Galvin, Reed Solomon:
Reverse mathematics and infinite traceable graphs. Math. Log. Q. 58(1-2): 18-28 (2012) - [c3]Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst:
On Mathias Generic Sets. CiE 2012: 129-138
2000 – 2009
- 2009
- [j22]Peter Cholak, Theodore A. Slaman, Carl G. Jockusch Jr.:
Corrigendum to: "On the strength of Ramsey's Theorem for pairs". J. Symb. Log. 74(4): 1438-1439 (2009) - 2008
- [j21]Peter Cholak, Rodney G. Downey, Leo Harrington:
The Complexity of Orbits of Computably Enumerable Sets. Bull. Symb. Log. 14(1): 69-87 (2008) - 2007
- [j20]Peter Cholak:
Introduction to the Special Issue on Vaught's Conjecture. Notre Dame J. Formal Log. 48(1): 1-2 (2007) - 2006
- [j19]Peter Cholak, Richard A. Shore, Reed Solomon:
A computably stable structure with no Scott family of finitary formulas. Arch. Math. Log. 45(5): 519-538 (2006) - [j18]Peter Cholak, Noam Greenberg, Joseph S. Miller
:
Uniform almost everywhere domination. J. Symb. Log. 71(3): 1057-1072 (2006) - 2004
- [j17]Peter Cholak, Alberto Marcone, Reed Solomon:
Reverse mathematics and the equivalence of definitions for well and better quasi-orders. J. Symb. Log. 69(3): 683-712 (2004) - 2003
- [j16]Peter Cholak, Leo Harrington:
Isomorphisms of splits of computably enumerable sets. J. Symb. Log. 68(3): 1044-1064 (2003) - 2002
- [j15]Peter A. Cholak, Leo Harrington:
On the Definability of the double jump in the computably Enumerable Sets. J. Math. Log. 2(2) (2002) - [j14]Peter Cholak, Rodney G. Downey, Stephen Walk:
Maximal Contiguous Degrees. J. Symb. Log. 67(1): 409-437 (2002) - 2001
- [j13]Peter Cholak, Rodney G. Downey, Eberhard Herrmann:
Some orbits for E. Ann. Pure Appl. Log. 107(1-3): 193-226 (2001) - [j12]Peter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman:
On The Strength of Ramsey's Theorem for Pairs. J. Symb. Log. 66(1): 1-55 (2001) - [j11]Peter Cholak, Marcia J. Groszek, Theodore A. Slaman:
An Almost Deep Degree. J. Symb. Log. 66(2): 881-901 (2001) - 2000
- [j10]Peter Cholak, Leo Harrington:
Definable encodings in the computably enumerable sets. Bull. Symb. Log. 6(2): 185-196 (2000)
1990 – 1999
- 1999
- [j9]Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore:
Computably Categorical Structures and Expansions by Constants. J. Symb. Log. 64(1): 13-37 (1999) - 1998
- [j8]Peter Cholak:
The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets. Ann. Pure Appl. Log. 94(1-3): 37-44 (1998) - 1997
- [j7]Christopher J. Ash, Peter Cholak, Julia F. Knight:
Permitting, Forcing, and Copying of a Given Recursive Relation. Ann. Pure Appl. Log. 86(3): 219-236 (1997) - 1995
- [b1]Peter Cholak:
Automorphisms of the lattice of recursively enumerable sets. Memoirs of the American Mathematical Society 541, American Mathematical Society 1995, ISBN 978-0-8218-2601-0, pp. I-VII, 1-151 - [c2]Peter Cholak, Rod Downey, Richard A. Shore:
Intervals Without Critical Triples. Logic Colloquium 1995: 17-43 - 1994
- [j6]Peter Cholak:
The translation theorem. Arch. Math. Log. 33(2): 87-108 (1994) - [j5]Peter A. Cholak, Peter G. Hinman:
Iterated relative recursive enumerability. Arch. Math. Log. 33(5): 321-346 (1994) - [j4]Peter Cholak, Howard A. Blair:
The Complexity of Local Stratification. Fundam. Informaticae 21(4): 333-344 (1994) - 1993
- [j3]Peter Cholak, Rodney G. Downey:
Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees. Ann. Pure Appl. Log. 61(3): 195-221 (1993) - [j2]Peter Cholak, Rodney G. Downey:
On the Cantor-Bendixon Rank of Recursively Enumerable Sets. J. Symb. Log. 58(2): 629-640 (1993) - 1992
- [c1]Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman:
Degrees of Inferability. COLT 1992: 180-192 - 1990
- [j1]Peter Cholak:
Boolean Algebras and Orbits of the Lattice of R.E. Sets Modulo the Finite Sets. J. Symb. Log. 55(2): 744-760 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
