The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Cholak: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman
    Degrees of Inferability. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:180-192 [Conf]
  2. Peter Cholak, Richard A. Shore, Reed Solomon
    A computably stable structure with no Scott family of finitary formulas. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2006, v:45, n:5, pp:519-538 [Journal]
  3. Christopher J. Ash, Peter Cholak, Julia F. Knight
    Permitting, Forcing, and Copying of a Given Recursive Relation. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:86, n:3, pp:219-236 [Journal]
  4. Peter Cholak
    The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:37-44 [Journal]
  5. Peter Cholak, Rodney G. Downey
    Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:61, n:3, pp:195-221 [Journal]
  6. Peter Cholak, Rodney G. Downey, Eberhard Herrmann
    Some orbits for E. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:107, n:1-3, pp:193-226 [Journal]
  7. Peter Cholak, Leo Harrington
    Definable encodings in the computably enumerable sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2000, v:6, n:2, pp:185-196 [Journal]
  8. Peter Cholak, Howard A. Blair
    The Complexity of Local Stratification. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:21, n:4, pp:333-344 [Journal]
  9. Peter Cholak
    Boolean Algebras and Orbits of the Lattice of R.E. Sets Modulo the Finite Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:2, pp:744-760 [Journal]
  10. Peter Cholak, Rodney G. Downey
    On the Cantor-Bendixon Rank of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:2, pp:629-640 [Journal]
  11. Peter Cholak, Rodney G. Downey, Stephen Walk
    Maximal Contiguous Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:409-437 [Journal]
  12. Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore
    Computably Categorical Structures and Expansions by Constants. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:13-37 [Journal]
  13. Peter Cholak, Marcia J. Groszek, Theodore A. Slaman
    An Almost Deep Degree. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:2, pp:881-901 [Journal]
  14. Peter Cholak, Leo Harrington
    Isomorphisms of splits of computably enumerable sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2003, v:68, n:3, pp:1044-1064 [Journal]
  15. Peter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman
    On The Strength of Ramsey's Theorem for Pairs. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:1, pp:1-55 [Journal]

  16. The Complexity of Orbits of Computably Enumerable Sets. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002