Theodore Slaman

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 the partial order of the Turing degrees is logically equivalent to second order arithmetic. They showed that the Bi-interpretability Conjecture is equivalent to there being no nontrivial automorphism of the Turing degrees. They also exhibited limits on the possible automorphisms of the Turing degrees by showing that any automorphism will be arithmetically definable.

References

*cite conference
last=Slaman
first=Theodore A.
author-link=Theodore Slaman
title=Degree structures
id=MathSciNet | id = 93b:03074
booktitle= Proceedings of the International Congress of Mathematicians, Vol. I, II (Kyoto, 1990)
year=1991
pages=303-316

External links

* [http://math.berkeley.edu/~slaman/ home page] .

*MathGenealogy |id=30966


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • 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… …   Deutsch 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

  • Gerald E. Sacks — Gerald Enoch Sacks (* 1933 in Brooklyn) ist ein US amerikanischer mathematischer Logiker. Sacks promovierte 1961 bei John Barkley Rosser an der Cornell University (On Suborderings of Degrees of Recursive Unsolvability). Ab 1962 war er Assistant… …   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 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

  • 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

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”