The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Theodore A. Slaman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wolfgang Maass, Theodore A. Slaman
    The Complexity Types of Computable Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:231-239 [Conf]
  2. Richard A. Shore, Theodore A. Slaman
    The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:68-76 [Conf]
  3. 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]
  4. Theodore A. Slaman, Robert Solovay
    When Oracles Do Not Help. [Citation Graph (0, 0)][DBLP]
    COLT, 1991, pp:379-383 [Conf]
  5. Wolfgang Maass, Theodore A. Slaman
    Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:318-326 [Conf]
  6. Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman
    Some Results on Effective Randomness. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:983-995 [Conf]
  7. Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin
    P01-Presentations of Algebras. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2006, v:45, n:6, pp:769-781 [Journal]
  8. Christopher J. Ash, Julia F. Knight, Mark S. Manasse, Theodore A. Slaman
    Generic Copies of Countable Structures. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:42, n:3, pp:195-205 [Journal]
  9. Rodney G. Downey, Theodore A. Slaman
    Completely Mitotic r.e. Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:41, n:2, pp:119-152 [Journal]
  10. Rodney G. Downey, Theodore A. Slaman
    On co-Simple Isols and Their Intersection Types. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:221-237 [Journal]
  11. Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan
    Extremes in the Degrees of Inferability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:66, n:3, pp:231-276 [Journal]
  12. Marcia J. Groszek, Theodore A. Slaman
    Pi0a Classes and Minimal Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:87, n:2, pp:117-144 [Journal]
  13. Christine Ann Haught, Theodore A. Slaman
    Automorphisms in the PTIME-Turing Degrees of Recursive Sets. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:84, n:1, pp:139-152 [Journal]
  14. Theodore A. Slaman
    The Density of Infima in the Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:52, n:1-2, pp:155-179 [Journal]
  15. Theodore A. Slaman, W. Hugh Woodin
    Extending Partial Orders to Dense Linear Orders. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:253-261 [Journal]
  16. André Nies, Richard A. Shore, Theodore A. Slaman
    Definability in the recursively enumerable degrees. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1996, v:2, n:4, pp:392-404 [Journal]
  17. Marcia J. Groszek, Theodore A. Slaman
    A basis theorem for perfect sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1998, v:4, n:2, pp:204-209 [Journal]
  18. Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman
    Computably Enumerable Algebras, Their Expansions, and Isomorphisms. [Citation Graph (0, 0)][DBLP]
    IJAC, 2005, v:15, n:3, pp:437-454 [Journal]
  19. Wolfgang Maass, Theodore A. Slaman
    The Complexity Types of Computable Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:168-192 [Journal]
  20. Juichi Shinoda, Theodore A. Slaman
    On the Theory of the PTIME Degrees of the Recursive Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:41, n:3, pp:321-366 [Journal]
  21. Marat M. Arslanov, Geoffrey LaForte, Theodore A. Slaman
    Relative Enumerability in the Difference Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:2, pp:411-420 [Journal]
  22. William C. Calhoun, Theodore A. Slaman
    The Pi20 Enumeration Degrees Are Not Dense. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1364-1379 [Journal]
  23. 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]
  24. 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]
  25. Marcia J. Groszek, Michael E. Mytilinaios, Theodore A. Slaman
    The Sacks Density Theorem and Sigma2-Bounding. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:2, pp:450-467 [Journal]
  26. Peter G. Hinman, Theodore A. Slaman
    Jump Embeddings in Turing Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1991, v:56, n:2, pp:563-591 [Journal]
  27. Carl G. Jockusch Jr., Theodore A. Slaman
    On the Sigma2-Theory of the Upper Semilattice of Turing Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:1, pp:193-204 [Journal]
  28. Steffen Lempp, Theodore A. Slaman
    A Limit on Relative Genericity in the Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:2, pp:376-395 [Journal]
  29. Michael E. Mytilinaios, Theodore A. Slaman
    sigma2-Collection and the Infinite Injury Priority Method. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:1, pp:212-221 [Journal]
  30. Juichi Shinoda, Theodore A. Slaman
    Recursive in A Generic Real. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:1, pp:164-172 [Journal]
  31. Richard A. Shore, Theodore A. Slaman
    Working below a Highly Recursively Enumerable Degree. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:3, pp:824-859 [Journal]
  32. Theodore A. Slaman
    On the Kleene Degrees of pi11 Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:2, pp:352-359 [Journal]
  33. Theodore A. Slaman
    Sigma1 Definitions with Parameters. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:2, pp:453-461 [Journal]
  34. Theodore A. Slaman, John R. Steel
    Complementation in the Turing Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:1, pp:160-176 [Journal]
  35. David Seetapun, Theodore A. Slaman
    On the Strength of Ramsey's Theorem. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1995, v:36, n:4, pp:570-582 [Journal]
  36. Antonín Kucera, Theodore A. Slaman
    Randomness and Recursive Enumerability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:199-211 [Journal]
  37. Richard A. Shore, Theodore A. Slaman
    The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:97, n:2, pp:263-284 [Journal]
  38. Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman
    Some Results on Effective Randomness. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:5, pp:707-721 [Journal]

  39. Definability in the enumeration degrees. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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