| 2013 | ||
|---|---|---|
| j38 | Chris J. Conidis, Theodore A. Slaman: Random reals, the rainbow Ramsey theorem, and arithmetic conservation. J. Symb. Log. 78(1): 195-206 (2013) | |
| 2009 | ||
| j37 | ||
| j36 | Peter Cholak Jr., Theodore A. Slaman, Carl G. Jockusch Jr.: Corrigendum to: "On the strength of Ramsey's Theorem for pairs". J. Symb. Log. 74(4): 1438-1439 (2009) | |
| 2006 | ||
| j35 | Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin: P01-Presentations of Algebras. Arch. Math. Log. 45(6): 769-781 (2006) | |
| j34 | Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman: Some Results on Effective Randomness. Theory Comput. Syst. 39(5): 707-721 (2006) | |
| 2005 | ||
| j33 | Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman: Computably Enumerable Algebras, Their Expansions, and Isomorphisms. IJAC 15(3): 437-454 (2005) | |
| 2004 | ||
| j32 | Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman: Comparing DNR and WWKL. J. Symb. Log. 69(4): 1089-1104 (2004) | |
| c7 | Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman: Some Results on Effective Randomness. ICALP 2004: 983-995 | |
| 2003 | ||
| j31 | Michael E. Mytilinaios, Theodore A. Slaman: Differences between Resource Bounded Degree Structures. Notre Dame Journal of Formal Logic 44(1): 1-12 (2003) | |
| 2001 | ||
| j30 | 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) | |
| j29 | Peter Cholak, Marcia J. Groszek, Theodore A. Slaman: An Almost Deep Degree. J. Symb. Log. 66(2): 881-901 (2001) | |
| j28 | Antonín Kucera, Theodore A. Slaman: Randomness and Recursive Enumerability. SIAM J. Comput. 31(1): 199-211 (2001) | |
| 2000 | ||
| j27 | Juichi Shinoda, Theodore A. Slaman: Recursive in A Generic Real. J. Symb. Log. 65(1): 164-172 (2000) | |
| 1998 | ||
| j26 | Theodore A. Slaman, W. Hugh Woodin: Extending Partial Orders to Dense Linear Orders. Ann. Pure Appl. Logic 94(1-3): 253-261 (1998) | |
| j25 | Marcia J. Groszek, Theodore A. Slaman: A basis theorem for perfect sets. Bulletin of Symbolic Logic 4(2): 204-209 (1998) | |
| j24 | Marat M. Arslanov, Geoffrey LaForte, Theodore A. Slaman: Relative Enumerability in the Difference Hierarchy. J. Symb. Log. 63(2): 411-420 (1998) | |
| 1997 | ||
| j23 | Theodore A. Slaman, W. Hugh Woodin: Definability in the enumeration degrees. Arch. Math. Log. 36(4-5): 255-267 (1997) | |
| j22 | Christine Ann Haught, Theodore A. Slaman: Automorphisms in the PTIME-Turing Degrees of Recursive Sets. Ann. Pure Appl. Logic 84(1): 139-152 (1997) | |
| j21 | Marcia J. Groszek, Theodore A. Slaman: Pi0a Classes and Minimal Degrees. Ann. Pure Appl. Logic 87(2): 117-144 (1997) | |
| 1996 | ||
| j20 | André Nies, Richard A. Shore, Theodore A. Slaman: Definability in the recursively enumerable degrees. Bulletin of Symbolic Logic 2(4): 392-404 (1996) | |
| j19 | Marcia J. Groszek, Michael E. Mytilinaios, Theodore A. Slaman: The Sacks Density Theorem and Sigma2-Bounding. J. Symb. Log. 61(2): 450-467 (1996) | |
| j18 | William C. Calhoun, Theodore A. Slaman: The Pi20 Enumeration Degrees Are Not Dense. J. Symb. Log. 61(4): 1364-1379 (1996) | |
| 1995 | ||
| j17 | David Seetapun, Theodore A. Slaman: On the Strength of Ramsey's Theorem. Notre Dame Journal of Formal Logic 36(4): 570-582 (1995) | |
| 1994 | ||
| j16 | 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. Ann. Pure Appl. Logic 66(3): 231-276 (1994) | |
| 1993 | ||
| j15 | Carl G. Jockusch Jr., Theodore A. Slaman: On the Sigma2-Theory of the Upper Semilattice of Turing Degrees. J. Symb. Log. 58(1): 193-204 (1993) | |
| j14 | Richard A. Shore, Theodore A. Slaman: Working below a Highly Recursively Enumerable Degree. J. Symb. Log. 58(3): 824-859 (1993) | |
| 1992 | ||
| j13 | Rodney G. Downey, Theodore A. Slaman: On co-Simple Isols and Their Intersection Types. Ann. Pure Appl. Logic 56(1-3): 221-237 (1992) | |
| j12 | Wolfgang Maass, Theodore A. Slaman: The Complexity Types of Computable Sets. J. Comput. Syst. Sci. 44(2): 168-192 (1992) | |
| j11 | Richard A. Shore, Theodore A. Slaman: The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory. Theor. Comput. Sci. 97(2): 263-284 (1992) | |
| c6 | 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 | |
| 1991 | ||
| j10 | Theodore A. Slaman: The Density of Infima in the Recursively Enumerable Degrees. Ann. Pure Appl. Logic 52(1-2): 155-179 (1991) | |
| j9 | Peter G. Hinman, Theodore A. Slaman: Jump Embeddings in Turing Degrees. J. Symb. Log. 56(2): 563-591 (1991) | |
| c5 | ||
| 1990 | ||
| j8 | Juichi Shinoda, Theodore A. Slaman: On the Theory of the PTIME Degrees of the Recursive Sets. J. Comput. Syst. Sci. 41(3): 321-366 (1990) | |
| 1989 | ||
| j7 | Rodney G. Downey, Theodore A. Slaman: Completely Mitotic r.e. Degrees. Ann. Pure Appl. Logic 41(2): 119-152 (1989) | |
| j6 | Christopher J. Ash, Julia F. Knight, Mark S. Manasse, Theodore A. Slaman: Generic Copies of Countable Structures. Ann. Pure Appl. Logic 42(3): 195-205 (1989) | |
| j5 | Theodore A. Slaman, John R. Steel: Complementation in the Turing Degrees. J. Symb. Log. 54(1): 160-176 (1989) | |
| j4 | Steffen Lempp, Theodore A. Slaman: A Limit on Relative Genericity in the Recursively Enumerable Sets. J. Symb. Log. 54(2): 376-395 (1989) | |
| c4 | Richard A. Shore, Theodore A. Slaman: The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. Structure in Complexity Theory Conference 1989: 68-76 | |
| c3 | Wolfgang Maass, Theodore A. Slaman: The Complexity Types of Computable Sets. Structure in Complexity Theory Conference 1989: 231-239 | |
| c2 | Wolfgang Maass, Theodore A. Slaman: Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract). FCT 1989: 318-326 | |
| 1988 | ||
| j3 | Michael E. Mytilinaios, Theodore A. Slaman: sigma2-Collection and the Infinite Injury Priority Method. J. Symb. Log. 53(1): 212-221 (1988) | |
| c1 | Juichi Shinoda, Theodore A. Slaman: On the theory of the PTIME degrees of the recursive sets. Structure in Complexity Theory Conference 1988: 252-257 | |
| 1986 | ||
| j2 | ||
| j1 | ||
Data released under the ODC-BY 1.0 license — See also our legal information page