University of California, Berkeley • 970 Evans Hall #3840 • Berkeley, CA 94720-3840 USA • +1 (510) 642-6550 • +1 (510) 642-8204 (fax)
Mathematics Department

Navigation

Google Services
Google Logo

Site   WWW


Search Faculty





Faculty Listing
slaman.jpg
Name:  Theodore A. Slaman
Position: Professor
E-mail: 
Office: 719 Evans Hall
Research: Recursion theory, mathematical logic
Personal
Homepage: 
http://math.berkeley.edu/~slaman/
Selected publications. (Full BibServer listing):
  1. Reimann, Jan and Slaman, Theodore A. (2008). Measures and Their Random Reals. preprint. [arXiv] [GS?]
  2. Reimann, Jan and Slaman, Theodore A. (2007). Probability Measures and Effective Randomness. preprint. [pdf] [arXiv] [GS?]
  3. Kučera, Antonín and Slaman, Theodore A. (2006). Turing Incomparability in Scott Sets. Proc. Amer. Math. Soc. 135 3723-3731. [pdf] [arXiv] [GS?]
  4. 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] [MR] [GS?]
  5. Slaman, Theodore A. (2004). Σn-Bounding and Δn-Induction. Proc. Amer. Math. Soc. 132 2449-2456. [pdf] [MR] [GS?]
  6. 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] [MR] [GS?]
  7. Kučera, Antonín and Slaman, Theodore A. (2001). Randomness and recursive enumerability. SIAM J. Comput. 31 No.1, 199-211 (electronic). [pdf] [MR] [GS?]
  8. Groszek, Marcia J. and Slaman, Theodore A. (1998). A basis theorem for perfect sets. Bull. Symbolic Logic 4 No.2, 204-209. [pdf] [MR] [GS?]