Concepedia

Theodore A. Slaman

TA

52

Publications

1.8K

Citations

23

H-Index

1985

Active since

Affiliations

University of California, Berkeley(Current)

University of Chicago

Cornell University

Dartmouth College

University of Notre Dame

Theodore A. Slaman is an author at University of California, Berkeley specializing in engineering, computational complexity, and automated reasoning.

Top concepts

EngineeringComputational ComplexityDiscrete MathematicsFormal MethodsComputer ScienceAutomated ReasoningProof ComplexityProbabilityEntropyLinguistics

Publications per year

1985–2016

52

Publications

52

On the strength of Ramsey's theorem for pairs

Peter Cholak, Carl G. Jockusch, Theodore A. Slaman · Journal of Symbolic Logic · 2001 · 207 citations

Theory Of Computing, Combinatorics On Word, Effective Content +11

Generic copies of countable structures

Chris Ash, Julia F. Knight, Mark S. Manasse et al. · Annals of Pure and Applied Logic · 1989 · 148 citations

Mathematical Structure, Generic Programming, Formal Methods +2

Randomness and Recursive Enumerability

Antonín Kučera, Theodore A. Slaman · SIAM Journal on Computing · 2001 · 119 citations

Recursive Sequences, Enumerable Random Reals, Engineering +10

On the Strength of Ramsey's Theorem

David Seetapun, Theodore A. Slaman · Notre Dame Journal of Formal Logic · 1995 · 117 citations · Full text

Engineering, Graph Theory, Substructural Logic +14

Relative to any nonrecursive set

Theodore A. Slaman · Proceedings of the American Mathematical Society · 1998 · 91 citations · Full text

Nonrecursive Set, Math Xmlns, Script Upper M +4

Rows per page

1–5 of 52