Peter Cholak

	2012
20		Peter Cholak, David Galvin, Reed Solomon: Reverse mathematics and infinite traceable graphs. Math. Log. Q. 58(1-2): 18-28 (2012)
	2008
19		Peter Cholak, Rodney G. Downey, Leo Harrington: The Complexity of Orbits of Computably Enumerable Sets. Bulletin of Symbolic Logic 14(1): 69-87 (2008)
	2007
18		Peter Cholak: Introduction to the Special Issue on Vaught's Conjecture. Notre Dame Journal of Formal Logic 48(1): 1-2 (2007)
	2006
17		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)
16		Peter Cholak, Noam Greenberg, Joseph S. Miller: Uniform almost everywhere domination. J. Symb. Log. 71(3): 1057-1072 (2006)
	2004
15		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
14		Peter Cholak, Leo Harrington: Isomorphisms of splits of computably enumerable sets. J. Symb. Log. 68(3): 1044-1064 (2003)
	2002
13		Peter Cholak, Rodney G. Downey, Stephen Walk: Maximal Contiguous Degrees. J. Symb. Log. 67(1): 409-437 (2002)
	2001
12		Peter Cholak, Rodney G. Downey, Eberhard Herrmann: Some orbits for E. Ann. Pure Appl. Logic 107(1-3): 193-226 (2001)
11		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)
10		Peter Cholak, Marcia J. Groszek, Theodore A. Slaman: An Almost Deep Degree. J. Symb. Log. 66(2): 881-901 (2001)
	2000
9		Peter Cholak, Leo Harrington: Definable encodings in the computably enumerable sets. Bulletin of Symbolic Logic 6(2): 185-196 (2000)
	1999
8		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
7		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)
	1997
6		Christopher J. Ash, Peter Cholak, Julia F. Knight: Permitting, Forcing, and Copying of a Given Recursive Relation. Ann. Pure Appl. Logic 86(3): 219-236 (1997)
	1994
5		Peter Cholak, Howard A. Blair: The Complexity of Local Stratification. Fundam. Inform. 21(4): 333-344 (1994)
	1993
4		Peter Cholak, Rodney G. Downey: Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees. Ann. Pure Appl. Logic 61(3): 195-221 (1993)
3		Peter Cholak, Rodney G. Downey: On the Cantor-Bendixon Rank of Recursively Enumerable Sets. J. Symb. Log. 58(2): 629-640 (1993)
	1992
2		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
1		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

1	Christopher J. Ash	[6]
2	Howard A. Blair	[5]
3	Rodney G. Downey (Rod Downey)	[2] [3] [4] [12] [13] [19]
4	Lance Fortnow	[2]
5	David Galvin	[20]
6	William I. Gasarch	[2]
7	Sergei S. Goncharov	[8]
8	Noam Greenberg	[16]
9	Marcia J. Groszek	[10]
10	Leo Harrington	[9] [14] [19]
11	Eberhard Herrmann	[12]
12	Carl G. Jockusch Jr.	[11]
13	Bakhadyr Khoussainov	[8]
14	Efim B. Kinber	[2]
15	Julia F. Knight	[6]
16	Martin Kummer	[2]
17	Stuart A. Kurtz	[2]
18	Alberto Marcone	[15]
19	Joseph S. Miller	[16]
20	Richard A. Shore	[8] [17]
21	Theodore A. Slaman	[2] [10] [11]
22	Reed Solomon	[15] [17] [20]
23	Stephen Walk	[13]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page