Theodore A. Slaman

65 papers A* 3B 1Journal 56Unranked 4

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	IN MEMORIAM: GERALD E. SACKS, 1933-2019. Bull. Symb. Log. Manuel Lerman, Theodore A. Slaman
2019	J	`jnl`	Schmerl decompositions in first order arithmetic. Ann. Pure Appl. Log. François G. Dorais, Zachary Evans, Marcia J. Groszek, Seth Harris, Theodore A. Slaman
2018	J	`jnl`	The strength of Ramsey's Theorem for Pairs and arbitrarily Many Colors. J. Symb. Log. Theodore A. Slaman, Keita Yokoyama
2017	J	`jnl`	On absolutely normal numbers and their discrepancy estimate. CoRR Verónica Becher, Adrian-Maria Scheerer, Theodore A. Slaman
2017	—	`conf`	Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. Computability and Complexity Leo Harrington, Richard A. Shore, Theodore A. Slaman
2015	J	`jnl`	A computable absolutely normal Liouville number. Math. Comput. Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
2015	J	`jnl`	On the existence of a strong minimal pair. J. Math. Log. George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman
2014	J	`jnl`	A note on initial Segments of the Enumeration Degrees. J. Symb. Log. Theodore A. Slaman, Andrea Sorbi
2014	J	`jnl`	Generics for computable Mathias forcing. Ann. Pure Appl. Log. Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst, Theodore A. Slaman
2014	J	`jnl`	On the normality of numbers to different bases. J. Lond. Math. Soc. Verónica Becher, Theodore A. Slaman
2014	J	`jnl`	On zeros of Martin-Löf random Brownian motion. J. Log. Anal. Laurent Bienvenu, Kelty Allen, Theodore A. Slaman
2013	J	`jnl`	A polynomial-time algorithm for computing absolutely normal numbers. Inf. Comput. Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
2013	J	`jnl`	Normal Numbers and the Borel Hierarchy. CoRR Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
2013	J	`jnl`	Random reals, the rainbow Ramsey theorem, and arithmetic conservation. J. Symb. Log. Chris J. Conidis, Theodore A. Slaman
2013	J	`jnl`	Relative to any non-Hyperarithmetic Set. J. Math. Log. Noam Greenberg, Antonio Montalbán, Theodore A. Slaman
2012	J	`jnl`	The n-R.E. Degrees: Undecidability and σ J. Math. Log. Mingzhong Cai, Richard A. Shore, Theodore A. Slaman
2009	J	`jnl`	Corrigendum to: "On the strength of Ramsey's Theorem for pairs". J. Symb. Log. Peter Cholak, Theodore A. Slaman, Carl G. Jockusch Jr.
2009	J	`jnl`	Low upper bounds of ideals. J. Symb. Log. Antonín Kucera, Theodore A. Slaman
2006	J	`jnl`	P Arch. Math. Log. Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin
2006	J	`jnl`	Some Results on Effective Randomness. Theory Comput. Syst. Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman
2006	J	`jnl`	The Theory of the Metarecursively Enumerable Degrees. J. Math. Log. Noam Greenberg, Richard A. Shore, Theodore A. Slaman
2005	J	`jnl`	Computably Enumerable Algebras, Their Expansions, and Isomorphisms. Int. J. Algebra Comput. Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman
2005	J	`jnl`	On Extensions of Embeddings into the Enumeration Degrees of the -Sets. J. Math. Log. Steffen Lempp, Theodore A. Slaman, Andrea Sorbi
2004	J	`jnl`	Comparing DNR and WWKL. J. Symb. Log. Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman
2004	A*	`conf`	Some Results on Effective Randomness. ICALP Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman
2003	J	`jnl`	Differences between Resource Bounded Degree Structures. Notre Dame J. Formal Log. Michael E. Mytilinaios, Theodore A. Slaman
2001	J	`jnl`	An Almost Deep Degree. J. Symb. Log. Peter Cholak, Marcia J. Groszek, Theodore A. Slaman
2001	J	`jnl`	On The Strength of Ramsey's Theorem for Pairs. J. Symb. Log. Peter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman
2001	J	`jnl`	Randomness and Recursive Enumerability. SIAM J. Comput. Antonín Kucera, Theodore A. Slaman
2000	J	`jnl`	Recursive in A Generic Real. J. Symb. Log. Juichi Shinoda, Theodore A. Slaman
1999	—	`ch.`	The Global Structure of the Turing Degrees. Handbook of Computability Theory Theodore A. Slaman
1998	J	`jnl`	A basis theorem for perfect sets. Bull. Symb. Log. Marcia J. Groszek, Theodore A. Slaman
1998	J	`jnl`	Extending Partial Orders to Dense Linear Orders. Ann. Pure Appl. Log. Theodore A. Slaman, W. Hugh Woodin
1998	J	`jnl`	Relative Enumerability in the Difference Hierarchy. J. Symb. Log. Marat M. Arslanov, Geoffrey LaForte, Theodore A. Slaman
1997	J	`jnl`	Automorphisms in the PTIME-Turing Degrees of Recursive Sets. Ann. Pure Appl. Log. Christine Ann Haught, Theodore A. Slaman
1997	J	`jnl`	Definability in the enumeration degrees. Arch. Math. Log. Theodore A. Slaman, W. Hugh Woodin
1997	J	`jnl`	Pi Ann. Pure Appl. Log. Marcia J. Groszek, Theodore A. Slaman
1996	J	`jnl`	Definability in the recursively enumerable degrees. Bull. Symb. Log. André Nies, Richard A. Shore, Theodore A. Slaman
1996	J	`jnl`	The Pi J. Symb. Log. William C. Calhoun, Theodore A. Slaman
1996	J	`jnl`	The Sacks Density Theorem and Sigma J. Symb. Log. Marcia J. Groszek, Michael E. Mytilinaios, Theodore A. Slaman
1995	J	`jnl`	On the Strength of Ramsey's Theorem. Notre Dame J. Formal Log. David Seetapun, Theodore A. Slaman
1994	J	`jnl`	Extremes in the Degrees of Inferability. Ann. Pure Appl. Log. Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan
1993	J	`jnl`	On the Sigma J. Symb. Log. Carl G. Jockusch Jr., Theodore A. Slaman
1993	J	`jnl`	Working below a Highly Recursively Enumerable Degree. J. Symb. Log. Richard A. Shore, Theodore A. Slaman
1992	A*	`conf`	Degrees of Inferability. COLT Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman
1992	J	`jnl`	On co-Simple Isols and Their Intersection Types. Ann. Pure Appl. Log. Rodney G. Downey, Theodore A. Slaman
1992	J	`jnl`	The Complexity Types of Computable Sets. J. Comput. Syst. Sci. Wolfgang Maass, Theodore A. Slaman
1992	J	`jnl`	The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory. Theor. Comput. Sci. Richard A. Shore, Theodore A. Slaman
1991	J	`jnl`	Jump Embeddings in Turing Degrees. J. Symb. Log. Peter G. Hinman, Theodore A. Slaman
1991	J	`jnl`	The Density of Infima in the Recursively Enumerable Degrees. Ann. Pure Appl. Log. Theodore A. Slaman
1991	A*	`conf`	When Oracles Do Not Help. COLT Theodore A. Slaman, Robert Solovay
1990	J	`jnl`	On the Theory of the PTIME Degrees of the Recursive Sets. J. Comput. Syst. Sci. Juichi Shinoda, Theodore A. Slaman
1990	J	`jnl`	Working below a low Arch. Math. Log. Richard A. Shore, Theodore A. Slaman
1989	J	`jnl`	A Limit on Relative Genericity in the Recursively Enumerable Sets. J. Symb. Log. Steffen Lempp, Theodore A. Slaman
1989	J	`jnl`	Complementation in the Turing Degrees. J. Symb. Log. Theodore A. Slaman, John R. Steel
1989	J	`jnl`	Completely Mitotic r.e. Degrees. Ann. Pure Appl. Log. Rodney G. Downey, Theodore A. Slaman
1989	B	`conf`	Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract). FCT Wolfgang Maass, Theodore A. Slaman
1989	J	`jnl`	Generic Copies of Countable Structures. Ann. Pure Appl. Log. Christopher J. Ash, Julia F. Knight, Mark S. Manasse, Theodore A. Slaman
1989	—	`conf`	The Complexity Types of Computable Sets. SCT Wolfgang Maass, Theodore A. Slaman
1989	—	`conf`	The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. SCT Richard A. Shore, Theodore A. Slaman
1988	—	`conf`	On the theory of the PTIME degrees of the recursive sets. SCT Juichi Shinoda, Theodore A. Slaman
1988	J	`jnl`	sigma J. Symb. Log. Michael E. Mytilinaios, Theodore A. Slaman
1986	J	`jnl`	On the Kleene Degrees of pi J. Symb. Log. Theodore A. Slaman
1986	J	`jnl`	Sigma J. Symb. Log. Theodore A. Slaman
1985	J	`jnl`	Reflection and forcing in E-recursion theory. Ann. Pure Appl. Log. Theodore A. Slaman