- The Principal Orbits How to describe this structure? Coding & Automorphisms Dynamic Properties & Degrees The Computably Enumerable Sets
- FREE SETS AND REVERSE MATHEMATICS PETER A. CHOLAK, MARIAGNESE GIUSTO, JEFFRY L. HIRST AND CARL G. JOCKUSCH, JR.
- Themes/Review The Classic Examples Dynamic Properties Invariant Classes Index Sets The Computably Enumerable Sets
- An Almost Deep Degree Peter Cholak
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
- A DEFINABLE RELATION BETWEEN C.E. SETS AND IDEALS A Dissertation
- ARITHMETICAL KNOWLEDGE AND ARITHMETICAL DEFINABILITY: FOUR STUDIES
- THE COMPUTABLY ENUMERABLE SETS: RECENT RESULTS AND FUTURE DIRECTIONS
- Harrington, 1989 Harrington, 19891997 Harrington, 19972007 Harrington, 2007 Definability in the
- Reverse mathematics and infinite traceable graphs Peter Cholak
- Progress on the c.e. sets: Improving and Proving the
- Progress on the c.e. sets: Improving and Proving the
- ATOMLESS r-MAXIMAL SETS PETER A. CHOLAK AND ANDRE NIES
- Iterated Relative Recursive Enumerability1 by Peter A. Cholak2 and Peter G. Hinman
- THE DENSE SIMPLE SETS ARE ORBIT COMPLETE WITH RESPECT TO THE SIMPLE SETS
- ERRATA FOR "ON THE STRENGTH OF RAMSEY'S THEOREM FOR PAIRS"
- ON THE STRENGTH OF RAMSEY'S THEOREM FOR PETER A. CHOLAK, CARL G. JOCKUSCH, JR., AND
- ISOMORPHISMS OF SPLITS OF COMPUTABLY ENUMERABLE SETS
- Reverse mathematics and the equivalence of definitions for well and better quasi-orders
- UNIFORM ALMOST EVERYWHERE DOMINATION PETER CHOLAK, NOAM GREENBERG, AND JOSEPH S. MILLER
- THE COMPLEXITY OF ORBITS OF COMPUTABLY ENUMERABLE SETS
- EXTENSION THEOREMS, ORBITS, AND AUTOMORPHISMS OF THE COMPUTABLY ENUMERABLE SETS
- Undecidability and Definability for Parameterized Polynomial Time m-Reducibilities1
- Contemporary Mathematics The global structure of computably enumerable sets
- LECTURES ON EFFECTIVE RANDOMNESS PETER CHOLAK
- Basic Concepts Domination Randomness Existence Reverse Mathematics Proof Sketches Computability Theory
- Themes/Review Dynamic Properties Invariant Classes Index Sets d-Simple Sets The Computably Enumerable Sets
- Basic Concepts Domination Randomness Reverse Mathematics Computability Theory
- TOWARD THE DEFINABILITY OF THE ARRAY NONCOMPUTABLE A Dissertation
- RELATIVIZATION, CATEGORICITY, AND DIMENSION A Dissertation
- ON THE ELEMENTARY THEORIES OF THE MUCHNIK AND MEDVEDEV LATTICES OF 0
- ALGORITHMICALLY RANDOM CLOSED SETS AND PROBABILITY A Dissertation
- Curriculum Vitae Peter Cholak
- INTERVALS WITHOUT CRITICAL TRIPLES PETER CHOLAK, ROD DOWNEY AND RICHARD SHORE
- Computably Categorical Structures and Expansions by Constants
- ON THE ORBITS OF COMPUTABLY ENUMERABLE SETS
- The Complexity of Local Stratification Peter Cholak
- INVARIANCE AND NONINVARIANCE IN THE LATTICE OF 0 PETER A. CHOLAK AND ROD DOWNEY
- Basic Concepts Domination Randomness Existence Reverse Mathematics Proof Sketches Computability Theory
- Some Orbits for E Peter Cholak
- MAXIMAL CONTIGUOUS DEGREES PETER CHOLAK, ROD DOWNEY, AND STEPHEN WALK
- AUTOMORPHISMS OF THE LATTICE OF 0 1 CLASSES; PERFECT THIN
- Uniform almost everywhere Peter Cholak
- On Ramsey's Theorem for Pairs Peter A. Cholak, Carl G. Jockusch Jr., and Theodore A.
- openarchive 3/7/05 9:50:03 PMPM 1 Academic Publishing
- DEFINABLE ENCODINGS IN THE COMPUTABLY ENUMERABLE SETS
- September 24, 2007 STRONG JUMP-TRACEABILITY I : THE COMPUTABLY
- Will he finish in time? No way! Yes! Strong Jump-Traceability
- Basic Concepts Domination Randomness Existence Reverse Mathematics Proof Sketches Computability Theory
- Basic Concepts Domination Randomness Reverse Mathematics Computability Theory
- Basic Concepts Domination Randomness Reverse Mathematics Computability Theory
- On n-Tardy Sets Peter A. Cholak,a,1
- Beginning Goals Blackground WKL Results RT results prior to CJS RT by CJS Summary Ramsey Theory and Reverse Mathematics
- Traceable Graphs C.e. Partial Orderings A Ramsey-type Knig's Lemma Some Projects in Reverse Mathematics
- Mathematical (Academic) Publishing revised 10/28/2011
- TATIS DOMIN Questions Degrees Questions Again Examples D-Maximal Sets Classification Questions Yet Again
- ON MATHIAS GENERIC SETS PETER A. CHOLAK, DAMIR D. DZHAFAROV, AND JEFFRY L. HIRST
- COMPUTABLY ENUMERABLE PARTIAL ORDERS PETER A. CHOLAK, DAMIR D. DZHAFAROV, NOAH SCHWEBER,
