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