Reflection and forcing in E-recursion theory. - Theodore A. Slaman (Ann. Pure Appl. Log., 1985)

On the Kleene Degrees of pi11 Sets. - Theodore A. Slaman (J. Symb. Log., 1986)

Sigma1 Definitions with Parameters. - Theodore A. Slaman (J. Symb. Log., 1986)

sigma2-Collection and the Infinite Injury Priority Method. - Michael E. Mytilinaios; Theodore A. Slaman (J. Symb. Log., 1988)

The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. - Richard A. Shore; Theodore A. Slaman (SCT, 1989)

Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract). - Wolfgang Maass 001; Theodore A. Slaman (FCT, 1989)

Generic Copies of Countable Structures. - Christopher J. Ash; Julia F. Knight; Mark S. Manasse; Theodore A. Slaman (Ann. Pure Appl. Log., 1989)

Completely Mitotic r.e. Degrees. - Rodney G. Downey; Theodore A. Slaman (Ann. Pure Appl. Log., 1989)

A Limit on Relative Genericity in the Recursively Enumerable Sets. - Steffen Lempp; Theodore A. Slaman (J. Symb. Log., 1989)

Complementation in the Turing Degrees. - Theodore A. Slaman; John R. Steel (J. Symb. Log., 1989)

Working below a low2 recursively enumerably degree. - Richard A. Shore; Theodore A. Slaman (Arch. Math. Log., 1990)

On the Theory of the PTIME Degrees of the Recursive Sets. - Juichi Shinoda; Theodore A. Slaman (J. Comput. Syst. Sci., 1990)

When Oracles Do Not Help. - Theodore A. Slaman; Robert Solovay (COLT, 1991)

The Density of Infima in the Recursively Enumerable Degrees. - Theodore A. Slaman (Ann. Pure Appl. Log., 1991)

Jump Embeddings in Turing Degrees. - Peter G. Hinman; Theodore A. Slaman (J. Symb. Log., 1991)

Degrees of Inferability. - Peter Cholak; Efim B. Kinber; Rodney G. Downey; Martin Kummer; Lance Fortnow; Stuart A. Kurtz; William I. Gasarch; Theodore A. Slaman (COLT, 1992)

On co-Simple Isols and Their Intersection Types. - Rodney G. Downey; Theodore A. Slaman (Ann. Pure Appl. Log., 1992)

The Complexity Types of Computable Sets. - Wolfgang Maass 001; Theodore A. Slaman (J. Comput. Syst. Sci., 1992)

The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory. - Richard A. Shore; Theodore A. Slaman (Theor. Comput. Sci., 1992)

On the Sigma2-Theory of the Upper Semilattice of Turing Degrees. - Carl G. Jockusch Jr.; Theodore A. Slaman (J. Symb. Log., 1993)

Working below a Highly Recursively Enumerable Degree. - Richard A. Shore; Theodore A. Slaman (J. Symb. Log., 1993)

Extremes in the Degrees of Inferability. - Lance Fortnow; William I. Gasarch; Sanjay Jain 001; Efim B. Kinber; Martin Kummer; Stuart A. Kurtz; Mark Pleszkovich; Theodore A. Slaman; Robert Solovay; Frank Stephan 001 (Ann. Pure Appl. Log., 1994)

On the Strength of Ramsey's Theorem. - David Seetapun; Theodore A. Slaman (Notre Dame J. Formal Log., 1995)

Definability in the recursively enumerable degrees. - André Nies; Richard A. Shore; Theodore A. Slaman (Bull. Symb. Log., 1996)

The Pi20 Enumeration Degrees Are Not Dense. - William C. Calhoun; Theodore A. Slaman (J. Symb. Log., 1996)

The Sacks Density Theorem and Sigma2-Bounding. - Marcia J. Groszek; Michael E. Mytilinaios; Theodore A. Slaman (J. Symb. Log., 1996)

Definability in the enumeration degrees. - Theodore A. Slaman; W. Hugh Woodin (Arch. Math. Log., 1997)

Pi0a Classes and Minimal Degrees. - Marcia J. Groszek; Theodore A. Slaman (Ann. Pure Appl. Log., 1997)

Automorphisms in the PTIME-Turing Degrees of Recursive Sets. - Christine Ann Haught; Theodore A. Slaman (Ann. Pure Appl. Log., 1997)

Extending Partial Orders to Dense Linear Orders. - Theodore A. Slaman; W. Hugh Woodin (Ann. Pure Appl. Log., 1998)

A basis theorem for perfect sets. - Marcia J. Groszek; Theodore A. Slaman (Bull. Symb. Log., 1998)

Relative Enumerability in the Difference Hierarchy. - Marat M. Arslanov; Geoffrey LaForte; Theodore A. Slaman (J. Symb. Log., 1998)

The Global Structure of the Turing Degrees. - Theodore A. Slaman (Handbook of Computability Theory, 1999)

Recursive in A Generic Real. - Juichi Shinoda; Theodore A. Slaman (J. Symb. Log., 2000)

An Almost Deep Degree. - Peter Cholak; Marcia J. Groszek; Theodore A. Slaman (J. Symb. Log., 2001)

On The Strength of Ramsey's Theorem for Pairs. - Peter Cholak; Carl G. Jockusch Jr.; Theodore A. Slaman (J. Symb. Log., 2001)

Randomness and Recursive Enumerability. - Antonín Kucera 002; Theodore A. Slaman (SIAM J. Comput., 2001)

Differences between Resource Bounded Degree Structures. - Michael E. Mytilinaios; Theodore A. Slaman (Notre Dame J. Formal Log., 2003)

Comparing DNR and WWKL. - Klaus Ambos-Spies; Bjørn Kjos-Hanssen; Steffen Lempp; Theodore A. Slaman (J. Symb. Log., 2004)

Computably Enumerable Algebras, Their Expansions, and Isomorphisms. - Bakhadyr Khoussainov; Steffen Lempp; Theodore A. Slaman (Int. J. Algebra Comput., 2005)

On Extensions of Embeddings into the Enumeration Degrees of the -Sets. - Steffen Lempp; Theodore A. Slaman; Andrea Sorbi (J. Math. Log., 2005)

P01-Presentations of Algebras. - Bakhadyr Khoussainov; Theodore A. Slaman; Pavel Semukhin (Arch. Math. Log., 2006)

The Theory of the Metarecursively Enumerable Degrees. - Noam Greenberg; Richard A. Shore; Theodore A. Slaman (J. Math. Log., 2006)

Some Results on Effective Randomness. - Wolfgang Merkle; Nenad Mihailovic; Theodore A. Slaman (Theory Comput. Syst., 2006)

Corrigendum to: "On the strength of Ramsey's Theorem for pairs". - Peter Cholak; Theodore A. Slaman; Carl G. Jockusch Jr. (J. Symb. Log., 2009)

Low upper bounds of ideals. - Antonín Kucera 002; Theodore A. Slaman (J. Symb. Log., 2009)

The n-R.E. Degrees: Undecidability and σ1 Substructures. - Mingzhong Cai; Richard A. Shore; Theodore A. Slaman (J. Math. Log., 2012)

Normal Numbers and the Borel Hierarchy. - Verónica Becher; Pablo Ariel Heiber; Theodore A. Slaman (CoRR, 2013)

A polynomial-time algorithm for computing absolutely normal numbers. - Verónica Becher; Pablo Ariel Heiber; Theodore A. Slaman (Inf. Comput., 2013)

Relative to any non-Hyperarithmetic Set. - Noam Greenberg; Antonio Montalbán; Theodore A. Slaman (J. Math. Log., 2013)

Random reals, the rainbow Ramsey theorem, and arithmetic conservation. - Chris J. Conidis; Theodore A. Slaman (J. Symb. Log., 2013)

Generics for computable Mathias forcing. - Peter Cholak; Damir D. Dzhafarov; Jeffry L. Hirst; Theodore A. Slaman (Ann. Pure Appl. Log., 2014)

On zeros of Martin-Löf random Brownian motion. - Laurent Bienvenu; Kelty Allen; Theodore A. Slaman (J. Log. Anal., 2014)

On the normality of numbers to different bases. - Verónica Becher; Theodore A. Slaman (J. Lond. Math. Soc., 2014)

A note on initial Segments of the Enumeration Degrees. - Theodore A. Slaman; Andrea Sorbi (J. Symb. Log., 2014)

On the existence of a strong minimal pair. - George Barmpalias; Mingzhong Cai; Steffen Lempp; Theodore A. Slaman (J. Math. Log., 2015)

A computable absolutely normal Liouville number. - Verónica Becher; Pablo Ariel Heiber; Theodore A. Slaman (Math. Comput., 2015)

Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. - Leo Harrington; Richard A. Shore; Theodore A. Slaman (Computability and Complexity, 2017)

On absolutely normal numbers and their discrepancy estimate. - Verónica Becher; Adrian-Maria Scheerer; Theodore A. Slaman (CoRR, 2017)

The strength of Ramsey's Theorem for Pairs and arbitrarily Many Colors. - Theodore A. Slaman; Keita Yokoyama (J. Symb. Log., 2018)

Schmerl decompositions in first order arithmetic. - François G. Dorais; Zachary Evans; Marcia J. Groszek; Seth Harris; Theodore A. Slaman (Ann. Pure Appl. Log., 2019)

IN MEMORIAM: GERALD E. SACKS, 1933-2019. - Manuel Lerman; Theodore A. Slaman (Bull. Symb. Log., 2022)