Theodore A. Slaman

Professor
Research
Primary Research Area: 
Mathematical Logic
Research Interests: 
Recursion theory, mathematical logic
Contact Information
719 Evans Hall
Office Hours: 
W 12:30-2:00
slaman [at] math [dot] berkeley [dot] edu
Year Appointed: 
1996
Publications
Selected Publications: 
  1. C. T. Chong, Theodore A. Slaman, and Yue Yang (2012). Π11-conservation of combinatorial principles weaker than Ramsey's theorem for pairs. Advances in Mathematics, 230:1060-1077. [ pdf ]
  2. Andrew Marks, Theodore A. Slaman, and John R. Steel (2011). Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations. preprint. [ arXiv ]
  3. Noam Greenberg, Antonio Montalbán, and Theodore A. Slaman (2011). The Slaman-Wehner theorem in higher recursion theory. Proc. Amer. Math. Soc., 139:1865-1869. [ pdf ]
  4. Chong, C. T. and Slaman, T. A. (2010). The theory of the α degrees is undecidable. Israel J. Math. 178 229-252.
  5. Reimann, Jan and Slaman, Theodore A. (2008). Measures and Their Random Reals. preprint. [ arXiv ]
  6. Kučera, Antonín and Slaman, Theodore A. (2007). Turing Incomparability in Scott Sets. Proc. Amer. Math. Soc. 135 3723-3731. [ arXiv ]
  7. Slaman, Theodore A. (2005). Aspects of the Turing jump. In Logic Colloquium 2000, Proceedings of the Annual Summer Meeting of the Association for Symbolic Logic, held in Paris, France, July 23-31, 2000 Cori, René and Razborov, Alexander and Todorčević, Stevo and Wood, Carol editors. 365-382 A K Peters, Ltd. Wellesley, Massachusetts. [ pdf ]
  8. Slaman, Theodore A. (2004). Σn-Bounding and Δn-Induction. Proc. Amer. Math. Soc. 132 2449-2456. [ pdf ]
  9. Cholak, Peter A. and Jockusch, Jr., Carl G. and Slaman, Theodore A. (2001). On the strength of Ramsey's theorem for pairs. J. Symbolic Logic 66 No.1, 1-55. [ pdf ]
  10. Kučera, Antonín and Slaman, Theodore A. (2001). Randomness and recursive enumerability. SIAM J. Comput. 31 No.1, 199-211 (electronic). [ pdf ]