Peter Cholak

发表

Density-1-Bounding and quasiminimality in the Generic Degrees

Peter Cholak, Gregory Igusa, 2017, J. Symb. Log..

On n-tardy sets

Peter Cholak, Karen Lange, Peter M. Gerdes, 2012, Ann. Pure Appl. Log..

Automorphisms of the lattice of recursively enumerable sets

Peter Cholak, 1995, Memoirs of the American Mathematical Society.

On Mathias Generic Sets

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

${\cal D}$-MAXIMAL SETS

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

Generics for computable Mathias forcing

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

Degrees of inferability

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

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

Peter Cholak, 1990, J. Symb. Log..

The C omplexity of Local Stratific ation

Howard A. Blair, Peter Cholak, 1991 .

Permitting, Forcing, and Copying of a Given Recursive Relation

Julia F. Knight, Peter Cholak, Christopher J. Ash, 1997, Ann. Pure Appl. Log..

Intervals Without Critical Triples

Rodney G. Downey, Richard A. Shore, Peter Cholak, 1995, Logic Colloquium.

The Complexity of Local Stratification

Howard A. Blair, Peter Cholak, 1994, Fundam. Informaticae.

Computably Enumerable Partial Orders

Richard A. Shore, Damir D. Dzhafarov, Peter Cholak, 2012, Comput..

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.

Computably categorical structures and expansions by constants

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

Introduction to the Special Issue on Vaught's Conjecture

Peter Cholak, 2007, Notre Dame J. Formal Log..

On the strength of Ramsey's theorem for pairs

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

The Complexity of Orbits of Computably Enumerable Sets

Rodney G. Downey, Leo Harrington, Peter Cholak, 2008, Bull. Symb. Log..

Definable Encodings in the Computably Enumerable Sets

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

An almost deep degree

Marcia J. Groszek, Theodore A. Slaman, Peter Cholak, 2001, Journal of Symbolic Logic.

Isomorphisms of splits of computably enumerable sets

Leo Harrington, Peter Cholak, 2003, J. Symb. Log..

1998–1999 Winter Meeting of the Association for Symbolic Logic

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

A computably stable structure with no Scott family of finitary formulas

Richard A. Shore, Peter Cholak, Reed Solomon, 2006, Arch. Math. Log..

Computably enumerable sets that are automorphic to low sets

Peter Cholak, Rachel Epstein, 2017, Comput..

Style Guide for Submission of Manuscripts to Notre Dame Journal of Formal Logic

Peter Cholak, Martha Kummerer, 2012 .

Some orbits for E

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

Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees

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

The translation theorem

Peter Cholak, 1994, Arch. Math. Log..

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

Peter Cholak, 1998, Ann. Pure Appl. Log..

On the Cantor-Bendixon Rank of Recursively Enumerable Sets

Rodney G. Downey, Peter Cholak, 1993, J. Symb. Log..

The Notre Dame lectures

Peter Cholak, 2016 .

Maximal Contiguous Degrees

Rodney G. Downey, Peter Cholak, Stephen Walk, 2002, J. Symb. Log..

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

Alberto Marcone, Peter Cholak, Reed Solomon, 2004, J. Symb. Log..

Uniform almost everywhere domination

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

Reverse mathematics and infinite traceable graphs

David Galvin, Peter Cholak, Reed Solomon, 2012, Math. Log. Q..

2021 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC

Guram Bezhanishvili, Dima Sinapova, Peter Cholak, 2021, The Bulletin of Symbolic Logic.

Effective Prime Uniqueness

Peter Cholak, Charlie McCoy, 2014 .

Algorithmically random closed sets and probability

Peter Cholak, Logan M. Axon, 2010 .

ATOMLESS r-MAXIMAL SETS

Peter Cholak, 2007 .

Toward the definability of the array noncomputable degrees

Peter Cholak, Stephen M. Walk, 1999 .

Computability Theory and Its Applications

Manuel Lerman, Richard A. Shore, Steffen Lempp, 2000 .

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

Michael Stob, Peter Cholak, Rod Downey, 1992 .

Computability theory and its applications : current trends and open problems : proceedings of a 1999 AMS-IMS-SIAM Joint Summer Research Conference, Computability Theory and Applications, June 13-17, 1999, University of Colorado, Boulder

Manuel Lerman, Richard A. Shore, Steffen Lempp, 2000 .

Intervals without Critical Triples

Rodney G. Downey, Richard A. Shore, Peter Cholak, 1998 .

Atomlessr-maximal sets

Peter Cholak, André Nies, 1999 .

Undecidability and Definability for Parametrized Polynomial Time m-Reducibilities

Peter Cholak, Rod Downey, 1993 .

Any FIP real computes a 1-generic

Peter Cholak, Rod Downey, Greg Igusa, 2015 .