Theodore A. Slaman

Theodore A. Slaman

Theodore Allan Slaman (* 17. April 1954) ist ein US-amerikanischer mathematischer Logiker.

Ted Slaman in Berkeley

Slaman studierte zunächst Physik an der Pennsylvania State University, wechselte dann aber zur mathematischen Logik und promovierte 1981 an der Harvard University bei Gerald E. Sacks (Aspects of E-recursion theory). Er war 1983 bis 1996 Professor an der University of Chicago und wurde danach Professor an der University of California, Berkeley. Er war dort 2005 Vorsitzender der Mathematik-Fakultät.

Slaman beschäftigt sich mit Rekursionstheorie. Mit W. Hugh Woodin formulierte er eine Vermutung über die Teilordnung der Turing-Grade (nämlich das es bei diesen keine nicht-trivialen Automorphismen gibt).

Er erhielt den President Young Investigator Award und den Alexander von Humboldt Research Award. 1990 war er Invited Speaker auf dem Internationalen Mathematikerkongress (ICM) in Kyoto (Degree Structures). 2001 war er Gödel-Lecturer (Recursion Theory).


Wikimedia Foundation.

Schlagen Sie auch in anderen Wörterbüchern nach:

  • Theodore Slaman — Theodore Allen Slaman is a professor of mathematics at the University of California, Berkeley who works in recursion theory. Slaman and W. Hugh Woodin formulated the Bi interpretability Conjecture for the Turing degrees, which conjectures that… …   Wikipedia

  • Richard A. Shore — Richard Arnold Shore (* 18. August 1946) ist ein US amerikanischer mathematischer Logiker, der sich vor allem mit Rekursionstheorie beschäftigt. Shore promovierte 1972 am Massachusetts Institute of Technology bei Gerald E. Sacks (Priority… …   Deutsch Wikipedia

  • Gödel-Lecturer — ist eine Ehrung in mathematischer Logik der Association for Symbolic Logic. Mit dem Preis ist eine Vorlesung verbunden. Der Preis ist nach Kurt Gödel benannt. Preisträger Jeweils mit dem Titel der Vorlesung: 1990 Ronald Jensen, Inner Models and… …   Deutsch Wikipedia

  • Turing degree — Post s problem redirects here. For the other Post s problem , see Post s correspondence problem. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic …   Wikipedia

  • Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown …   Wikipedia

  • Richard Shore — Infobox academic name = Richard A. Shore box width = image width = caption = birth date = birth place = death date = death place = residence = citizenship = USA nationality = ethnicity = field = Mathematics work institutions = Cornell University… …   Wikipedia

  • List of logicians — A logician is a person, such as a philosopher or mathematician, whose topic of scholarly study is logic. The famous logicians are listed below in English alphabetical transliteration order (by surname).compactTOC NOTOC A * Nate Ackerman (USA,… …   Wikipedia

  • Gerald Sacks — is a logician who holds a joint appointment at Harvard University as a Professor of Mathematical Logic and the Massachusetts Institute of Technology as a Professor Emeritus. His most important contributions have been in recursion theory. Named… …   Wikipedia

  • Tarski-Vaught test — The Tarski Vaught test (sometimes called Tarski s criterion) is a result in model theory which characterizes the elementary substructures of a given structure using definable sets. It is often used to determine whether a substructure of a… …   Wikipedia

  • Definable set — In mathematical logic, a definable set is an n ary relation on the domain of a structure whose elements are precisely those elements satisfying some formula in the language of that structure. A set can be defined with or without parameters, which …   Wikipedia

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.