| [1] | Peter A. Cholak and Leo A. Harrington. Extension theorems, orbits, and automorphisms of the computably enumerable sets. Trans. Amer. Math. Soc., 360(4):1759-1791, 2008. math.LO/0408279. Pdf. MR MR2366962. |
| [2] | Peter Cholak, Richard A. Shore, and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Arch. Math. Logic, 45(5):519-538, 2006. MR MR2231788 (2007b:03068). |
| [3] | Peter Cholak, Noam Greenberg, and Joseph S. Miller. Uniform almost everywhere domination. J. Symbolic Logic, 71(3):1057-1072, 2006. math.LO/0506019. Pdf. MR MR2251556. |
| [4] | Peter Cholak, Alberto Marcone, and Reed Solomon. Reverse mathematics and the equivalence of definitions for well and better quasi-orders. J. Symbolic Logic, 69(3):683-712, 2004. Pdf. MR 2005e:03020. |
| [5] | Peter A. Cholak and Rod Downey. Invariance and noninvariance in the lattice of Π01 classes. J. London Math. Soc. (2), 70(3):735-749, 2004. Pdf. MR 2005e:03092. |
| [6] | Peter Cholak. Boolean algebras and orbits of the lattice of r.e.sets modulo the finite sets. J. Symbolic Logic, 55(2):744-760, 1990. MR 91j:03055. |
| [7] | Peter Cholak, Rod Downey, and Micheal Stob. Automorphisms of the lattice of recursively enumerable sets: promptly simple sets. Trans. Amer. Math. Soc., 332(2):555-570, 1992. MR 92j:03039. |
| [8] | Peter Cholak and Rod Downey. Lattice nonembeddings and intervals of the recursively enumerable degrees. Ann. Pure Appl. Logic, 61(3):195-221, 1993. MR 94h:03080. |
| [9] | Peter Cholak and Rod Downey. On the Cantor-Bendixon rank of recursively enumerable sets. J. Symbolic Logic, 58(2):629-640, 1993. MR 94h:03081. |
| [10] | Peter Cholak and Rod Downey. Recursively enumerable m- and tt-degrees. III. Realizing all finite distributive lattices. J. London Math. Soc. (2), 50(3):440-453, 1994. Pdf. MR 95m:03089. |
| [11] | Peter Cholak and Rod Downey. Permutations and presentations. Proc. Amer. Math. Soc., 122(4):1237-1249, 1994. MR 95b:03046. |
| [12] | Peter Cholak. The translation theorem. Arch. Math. Logic, 33(2):87-108, 1994. MR 95d:03074. |
| [13] | Peter Cholak and Peter G. Hinman. Iterated relative recursive enumerability. Arch. Math. Logic, 33(5):321-346, 1994. Pdf. MR 96a:03056. |
| [14] | Peter Cholak and Howard A. Blair. The complexity of local stratification. Fund. Inform., 21(4):333-344, 1994. Pdf. MR 96b:68027. |
| [15] | Peter Cholak. Automorphisms of the lattice of recursively enumerable sets. Mem. Amer. Math. Soc., 113(541):viii+151, 1995. MR 95f:03064. |
| [16] | C. J. Ash, P. Cholak, and J. F. Knight. Permitting, forcing, and copying of a given recursive relation. Ann. Pure Appl. Logic, 86(3):219-236, 1997. MR 98j:03062. |
| [17] | Peter Cholak. The dense simple sets are orbit complete with respect to the simple sets. Ann. Pure Appl. Logic, 94(1-3):37-44, 1998. Conference on Computability Theory (Oberwolfach, 1996). Pdf. MR 99m:03081. |
| [18] | Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov, and Richard A. Shore. Computably categorical structures and expansions by constants. J. Symbolic Logic, 64(1):13-37, 1999. Pdf. MR 2001a:03079. |
| [19] | Peter Cholak and André Nies. Atomless r-maximal sets. Israel J. Math., 113:305-322, 1999. Pdf. MR 2001a:03087. |
| [20] | Peter Cholak and Leo A. Harrington. Definable encodings in the computably enumerable sets. Bull. Symbolic Logic, 6(2):185-196, 2000. Pdf. MR 2001k:03085. |
| [21] | Peter Cholak, Rod Downey, and Eberhard Herrmann. Some orbits for E. Ann. Pure Appl. Logic, 107(1-3):193-226, 2001. Pdf. MR 2001k:03086. |
| [22] | Peter Cholak, Carl G. Jockusch, and Theodore A. Slaman. On the strength of Ramsey's theorem for pairs. J. Symbolic Logic, 66(1):1-55, 2001. Pdf. MR 2002c:03094. |
| [23] | Peter Cholak, Marcia Groszek, and Theodore Slaman. An almost deep degree. J. Symbolic Logic, 66(2):881-901, 2001. Pdf. MR 2002d:03070. |
| [24] | Peter Cholak, Richard Coles, Rod Downey, and Eberhard Herrmann. Automorphisms of the lattice of Π01 classes: perfect thin classes and anc degrees. Trans. Amer. Math. Soc., 353(12):4899-4924 (electronic), 2001. Pdf. MR 2002f:03080. |
| [25] | Peter Cholak, Rod Downey, and Stephen Walk. Maximal contiguous degrees. J. Symbolic Logic, 67(1):409-437, 2002. Pdf. MR 2002m:03060. |
| [26] | Peter Cholak and Leo A. Harrington. On the definability of the double jump in the computably enumerable sets. J. Math. Log., 2(2):261-296, 2002. Pdf. MR 2003h:03063. |
| [27] | Peter Cholak and Leo A. Harrington. Isomorphisms of splits of computably enumerable sets. J. Symbolic Logic, 68(3):1044-1064, 2003. Pdf. MR 2004f:03077. |
This file has been generated by bibtex2html 1.87.