Theodore A. Slaman

Publication Activity (10 Years)

Years Active: 1985-2022
Publications (10 Years): 7

Top Topics

Color Quantization

Minimal Subsets

Brownian Motion

Quantifier Free

Top Venues

Ann. Pure Appl. Log.

Publications

Manuel Lerman, Theodore A. Slaman
IN MEMORIAM: GERALD E. SACKS, 1933-2019. Bull. Symb. Log. 28 (1) (2022)
François Dorais, Zachary Evans, Marcia J. Groszek, Seth Harris, Theodore A. Slaman
Schmerl decompositions in first order arithmetic. Ann. Pure Appl. Log. 170 (12) (2019)
Theodore A. Slaman, Keita Yokoyama
The strength of Ramsey's Theorem for Pairs and arbitrarily Many Colors. J. Symb. Log. 83 (4) (2018)
Leo Harrington, Richard A. Shore, Theodore A. Slaman
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. Computability and Complexity (2017)
Verónica Becher, Adrian-Maria Scheerer, Theodore A. Slaman
On absolutely normal numbers and their discrepancy estimate. CoRR (2017)
Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
A computable absolutely normal Liouville number. Math. Comput. 84 (296) (2015)
George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman
On the existence of a strong minimal pair. J. Math. Log. 15 (1) (2015)
Laurent Bienvenu, Kelty Allen, Theodore A. Slaman
On zeros of Martin-Löf random Brownian motion. J. Log. Anal. 6 (2014)
Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst, Theodore A. Slaman
Generics for computable Mathias forcing. Ann. Pure Appl. Log. 165 (9) (2014)
Theodore A. Slaman, Andrea Sorbi
A note on initial Segments of the Enumeration Degrees. J. Symb. Log. 79 (2) (2014)
Verónica Becher, Theodore A. Slaman
On the normality of numbers to different bases. J. Lond. Math. Soc. 90 (2) (2014)
Chris J. Conidis, Theodore A. Slaman
Random reals, the rainbow Ramsey theorem, and arithmetic conservation. J. Symb. Log. 78 (1) (2013)
Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
A polynomial-time algorithm for computing absolutely normal numbers. Inf. Comput. 232 (2013)
Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
Normal Numbers and the Borel Hierarchy. CoRR (2013)
Noam Greenberg, Antonio Montalbán, Theodore A. Slaman
Relative to any non-Hyperarithmetic Set. J. Math. Log. 13 (1) (2013)
Mingzhong Cai, Richard A. Shore, Theodore A. Slaman
Substructures. J. Math. Log. 12 (1) (2012)
Antonín Kucera, Theodore A. Slaman
Low upper bounds of ideals. J. Symb. Log. 74 (2) (2009)
Peter Cholak, Theodore A. Slaman, Carl G. Jockusch Jr.
Corrigendum to: "On the strength of Ramsey's Theorem for pairs". J. Symb. Log. 74 (4) (2009)
Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman
Some Results on Effective Randomness. Theory Comput. Syst. 39 (5) (2006)
Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin
-Presentations of Algebras. Arch. Math. Log. 45 (6) (2006)
Noam Greenberg, Richard A. Shore, Theodore A. Slaman
The Theory of the Metarecursively Enumerable Degrees. J. Math. Log. 6 (1) (2006)
Steffen Lempp, Theodore A. Slaman, Andrea Sorbi
On Extensions of Embeddings into the Enumeration Degrees of the -Sets. J. Math. Log. 5 (2) (2005)
Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman
Computably Enumerable Algebras, Their Expansions, and Isomorphisms. Int. J. Algebra Comput. 15 (3) (2005)
Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman
Some Results on Effective Randomness. ICALP (2004)
Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman
Comparing DNR and WWKL. J. Symb. Log. 69 (4) (2004)
Michael E. Mytilinaios, Theodore A. Slaman
Differences between Resource Bounded Degree Structures. Notre Dame J. Formal Log. 44 (1) (2003)
Peter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman
On The Strength of Ramsey's Theorem for Pairs. J. Symb. Log. 66 (1) (2001)
Peter Cholak, Marcia J. Groszek, Theodore A. Slaman
An Almost Deep Degree. J. Symb. Log. 66 (2) (2001)
Antonín Kucera, Theodore A. Slaman
Randomness and Recursive Enumerability. SIAM J. Comput. 31 (1) (2001)
Juichi Shinoda, Theodore A. Slaman
Recursive in A Generic Real. J. Symb. Log. 65 (1) (2000)
Theodore A. Slaman, W. Hugh Woodin
Extending Partial Orders to Dense Linear Orders. Ann. Pure Appl. Log. 94 (1-3) (1998)
Marcia J. Groszek, Theodore A. Slaman
A basis theorem for perfect sets. Bull. Symb. Log. 4 (2) (1998)
Marat M. Arslanov, Geoffrey LaForte, Theodore A. Slaman
Relative Enumerability in the Difference Hierarchy. J. Symb. Log. 63 (2) (1998)
Theodore A. Slaman, W. Hugh Woodin
Definability in the enumeration degrees. Arch. Math. Log. 36 (4-5) (1997)
Christine Ann Haught, Theodore A. Slaman
Automorphisms in the PTIME-Turing Degrees of Recursive Sets. Ann. Pure Appl. Log. 84 (1) (1997)
Marcia J. Groszek, Theodore A. Slaman
Classes and Minimal Degrees. Ann. Pure Appl. Log. 87 (2) (1997)
William C. Calhoun, Theodore A. Slaman
Enumeration Degrees Are Not Dense. J. Symb. Log. 61 (4) (1996)
André Nies, Richard A. Shore, Theodore A. Slaman
Definability in the recursively enumerable degrees. Bull. Symb. Log. 2 (4) (1996)
Marcia J. Groszek, Michael E. Mytilinaios, Theodore A. Slaman
-Bounding. J. Symb. Log. 61 (2) (1996)
David Seetapun, Theodore A. Slaman
On the Strength of Ramsey's Theorem. Notre Dame J. Formal Log. 36 (4) (1995)
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. Log. 66 (3) (1994)
Carl G. Jockusch Jr., Theodore A. Slaman
-Theory of the Upper Semilattice of Turing Degrees. J. Symb. Log. 58 (1) (1993)
Richard A. Shore, Theodore A. Slaman
Working below a Highly Recursively Enumerable Degree. J. Symb. Log. 58 (3) (1993)
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) (1992)
Wolfgang Maass, Theodore A. Slaman
The Complexity Types of Computable Sets. J. Comput. Syst. Sci. 44 (2) (1992)
Rodney G. Downey, Theodore A. Slaman
On co-Simple Isols and Their Intersection Types. Ann. Pure Appl. Log. 56 (1-3) (1992)
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)
Theodore A. Slaman
The Density of Infima in the Recursively Enumerable Degrees. Ann. Pure Appl. Log. 52 (1-2) (1991)
Peter G. Hinman, Theodore A. Slaman
Jump Embeddings in Turing Degrees. J. Symb. Log. 56 (2) (1991)
Theodore A. Slaman, Robert Solovay
When Oracles Do Not Help. COLT (1991)
Richard A. Shore, Theodore A. Slaman
recursively enumerably degree. Arch. Math. Log. 29 (3) (1990)
Juichi Shinoda, Theodore A. Slaman
On the Theory of the PTIME Degrees of the Recursive Sets. J. Comput. Syst. Sci. 41 (3) (1990)
Christopher J. Ash, Julia F. Knight, Mark S. Manasse, Theodore A. Slaman
Generic Copies of Countable Structures. Ann. Pure Appl. Log. 42 (3) (1989)
Steffen Lempp, Theodore A. Slaman
A Limit on Relative Genericity in the Recursively Enumerable Sets. J. Symb. Log. 54 (2) (1989)
Richard A. Shore, Theodore A. Slaman
The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. Computational Complexity Conference (1989)
Rodney G. Downey, Theodore A. Slaman
Completely Mitotic r.e. Degrees. Ann. Pure Appl. Log. 41 (2) (1989)
Wolfgang Maass, Theodore A. Slaman
The Complexity Types of Computable Sets. Computational Complexity Conference (1989)
Theodore A. Slaman, John R. Steel
Complementation in the Turing Degrees. J. Symb. Log. 54 (1) (1989)
Wolfgang Maass, Theodore A. Slaman
Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract). FCT (1989)
Juichi Shinoda, Theodore A. Slaman
On the theory of the PTIME degrees of the recursive sets. Computational Complexity Conference (1988)
Michael E. Mytilinaios, Theodore A. Slaman
-Collection and the Infinite Injury Priority Method. J. Symb. Log. 53 (1) (1988)
Theodore A. Slaman
Definitions with Parameters. J. Symb. Log. 51 (2) (1986)
Theodore A. Slaman
Sets. J. Symb. Log. 51 (2) (1986)
Theodore A. Slaman
Reflection and forcing in E-recursion theory. Ann. Pure Appl. Log. 29 (1) (1985)