Theodore A. Slaman

According to our database, Theodore A. Slaman authored at least 62 papers between 1985 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2022

IN MEMORIAM: GERALD E. SACKS, 1933-2019.

Manuel Lerman, Theodore A. Slaman

Bull. Symb. Log., 2022

2019

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

2018

The strength of Ramsey's Theorem for Pairs and arbitrarily Many Colors.

Theodore A. Slaman, Keita Yokoyama

J. Symb. Log., 2018

2017

On absolutely normal numbers and their discrepancy estimate.

Verónica Becher, Adrian-Maria Scheerer, Theodore A. Slaman

CoRR, 2017

Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1.

Leo Harrington, Richard A. Shore, Theodore A. Slaman

Proceedings of the Computability and Complexity, 2017

2015

A computable absolutely normal Liouville number.

Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman

Math. Comput., 2015

On the existence of a strong minimal pair.

George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman

J. Math. Log., 2015

2014

A note on initial Segments of the Enumeration Degrees.

Theodore A. Slaman, Andrea Sorbi

J. Symb. Log., 2014

On the normality of numbers to different bases.

Verónica Becher, Theodore A. Slaman

J. Lond. Math. Soc., 2014

On zeros of Martin-Löf random Brownian motion.

Laurent Bienvenu, Kelty Allen, Theodore A. Slaman

J. Log. Anal., 2014

Generics for computable Mathias forcing.

Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst, Theodore A. Slaman

Ann. Pure Appl. Log., 2014

2013

Random reals, the rainbow Ramsey theorem, and arithmetic conservation.

Chris J. Conidis, Theodore A. Slaman

J. Symb. Log., 2013

Relative to any non-Hyperarithmetic Set.

Noam Greenberg, Antonio Montalbán, Theodore A. Slaman

J. Math. Log., 2013

A polynomial-time algorithm for computing absolutely normal numbers.

Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman

Inf. Comput., 2013

Normal Numbers and the Borel Hierarchy.

Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman

CoRR, 2013

2012

The n-R.E. Degrees: Undecidability and σ₁ Substructures.

Mingzhong Cai, Richard A. Shore, Theodore A. Slaman

J. Math. Log., 2012

2009

Low upper bounds of ideals.

Antonín Kucera, Theodore A. Slaman

J. Symb. Log., 2009

Corrigendum to: "On the strength of Ramsey's Theorem for pairs".

Peter Cholak, Theodore A. Slaman, Carl G. Jockusch Jr.

J. Symb. Log., 2009

2006

Some Results on Effective Randomness.

Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman

Theory Comput. Syst., 2006

The Theory of the Metarecursively Enumerable Degrees.

Noam Greenberg, Richard A. Shore, Theodore A. Slaman

J. Math. Log., 2006

P⁰₁-Presentations of Algebras.

Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin

Arch. Math. Log., 2006

2005

On Extensions of Embeddings into the Enumeration Degrees of the -Sets.

Steffen Lempp, Theodore A. Slaman, Andrea Sorbi

J. Math. Log., 2005

Computably Enumerable Algebras, Their Expansions, and Isomorphisms.

Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman

Int. J. Algebra Comput., 2005

2004

Comparing DNR and WWKL.

Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman

J. Symb. Log., 2004

2003

Differences between Resource Bounded Degree Structures.

Michael E. Mytilinaios, Theodore A. Slaman

Notre Dame J. Formal Log., 2003

2001

Randomness and Recursive Enumerability.

Antonín Kucera, Theodore A. Slaman

SIAM J. Comput., 2001

On The Strength of Ramsey's Theorem for Pairs.

Peter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman

J. Symb. Log., 2001

An Almost Deep Degree.

Peter Cholak, Marcia J. Groszek, Theodore A. Slaman

J. Symb. Log., 2001

2000

Recursive in A Generic Real.

Juichi Shinoda, Theodore A. Slaman

J. Symb. Log., 2000

1999

The Global Structure of the Turing Degrees.

Theodore A. Slaman

Proceedings of the Handbook of Computability Theory, 1999

1998

Relative Enumerability in the Difference Hierarchy.

Marat M. Arslanov, Geoffrey LaForte, Theodore A. Slaman

J. Symb. Log., 1998

A basis theorem for perfect sets.

Marcia J. Groszek, Theodore A. Slaman

Bull. Symb. Log., 1998

Extending Partial Orders to Dense Linear Orders.

Theodore A. Slaman, W. Hugh Woodin

Ann. Pure Appl. Log., 1998

1997

Automorphisms in the PTIME-Turing Degrees of Recursive Sets.

Christine Ann Haught, Theodore A. Slaman

Ann. Pure Appl. Log., 1997

Pi⁰_a Classes and Minimal Degrees.

Marcia J. Groszek, Theodore A. Slaman

Ann. Pure Appl. Log., 1997

Definability in the enumeration degrees.

Theodore A. Slaman, W. Hugh Woodin

Arch. Math. Log., 1997

1996

The Sacks Density Theorem and Sigma₂-Bounding.

Marcia J. Groszek, Michael E. Mytilinaios, Theodore A. Slaman

J. Symb. Log., 1996

The Pi₂⁰ Enumeration Degrees Are Not Dense.

William C. Calhoun, Theodore A. Slaman

J. Symb. Log., 1996

Definability in the recursively enumerable degrees.

André Nies, Richard A. Shore, Theodore A. Slaman

Bull. Symb. Log., 1996

1995

On the Strength of Ramsey's Theorem.

David Seetapun, Theodore A. Slaman

Notre Dame J. Formal Log., 1995

1994

Extremes in the Degrees of Inferability.

Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan

Ann. Pure Appl. Log., 1994

1993

Working below a Highly Recursively Enumerable Degree.

Richard A. Shore, Theodore A. Slaman

J. Symb. Log., 1993

On the Sigma₂-Theory of the Upper Semilattice of Turing Degrees.

Carl G. Jockusch Jr., Theodore A. Slaman

J. Symb. Log., 1993

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

The Complexity Types of Computable Sets.

Wolfgang Maass, Theodore A. Slaman

J. Comput. Syst. Sci., 1992

On co-Simple Isols and Their Intersection Types.

Rodney G. Downey, Theodore A. Slaman

Ann. Pure Appl. Log., 1992

Degrees of Inferability.

Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Jump Embeddings in Turing Degrees.

Peter G. Hinman, Theodore A. Slaman

J. Symb. Log., 1991

The Density of Infima in the Recursively Enumerable Degrees.

Theodore A. Slaman

Ann. Pure Appl. Log., 1991

When Oracles Do Not Help.

Theodore A. Slaman, Robert Solovay

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990

On the Theory of the PTIME Degrees of the Recursive Sets.

Juichi Shinoda, Theodore A. Slaman

J. Comput. Syst. Sci., 1990

Working below a low₂ recursively enumerably degree.

Richard A. Shore, Theodore A. Slaman

Arch. Math. Log., 1990

1989

Complementation in the Turing Degrees.

Theodore A. Slaman, John R. Steel

J. Symb. Log., 1989

A Limit on Relative Genericity in the Recursively Enumerable Sets.

Steffen Lempp, Theodore A. Slaman

J. Symb. Log., 1989

Completely Mitotic r.e. Degrees.

Rodney G. Downey, Theodore A. Slaman

Ann. Pure Appl. Log., 1989

Generic Copies of Countable Structures.

Christopher J. Ash, Julia F. Knight, Mark S. Manasse, Theodore A. Slaman

Ann. Pure Appl. Log., 1989

Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract).

Wolfgang Maass, Theodore A. Slaman

Proceedings of the Fundamentals of Computation Theory, 1989

The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory.

Richard A. Shore, Theodore A. Slaman

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988

sigma₂-Collection and the Infinite Injury Priority Method.

Michael E. Mytilinaios, Theodore A. Slaman

J. Symb. Log., 1988

1986

Sigma₁ Definitions with Parameters.

Theodore A. Slaman

J. Symb. Log., 1986

On the Kleene Degrees of pi¹₁ Sets.

Theodore A. Slaman

J. Symb. Log., 1986

1985

Reflection and forcing in E-recursion theory.

Theodore A. Slaman

Ann. Pure Appl. Log., 1985