HOME

TheInfoList



OR:

Theodore Allen Slaman (born April 17, 1954) is a professor of mathematics at the
University of California, Berkeley The University of California, Berkeley (UC Berkeley, Berkeley, Cal, or California), is a Public university, public Land-grant university, land-grant research university in Berkeley, California, United States. Founded in 1868 and named after t ...
who works in
recursion theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since ex ...
. Slaman and W. Hugh Woodin formulated the Bi-interpretability Conjecture for the Turing degrees, which conjectures that the
partial order In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word ''partial'' is used to indicate that not every pair of elements needs to be comparable ...
of the Turing degrees is
logically equivalent In logic and mathematics, statements p and q are said to be logically equivalent if they have the same truth value in every model. The logical equivalence of p and q is sometimes expressed as p \equiv q, p :: q, \textsfpq, or p \iff q, depending on ...
to
second-order arithmetic In mathematical logic, second-order arithmetic is a collection of axiomatic systems that formalize the natural numbers and their subsets. It is an alternative to axiomatic set theory as a foundation of mathematics, foundation for much, but not all, ...
. They showed that the Bi-interpretability Conjecture is equivalent to there being no nontrivial
automorphism In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all 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

*


External links


home page
* Living people American logicians 20th-century American mathematicians 21st-century American mathematicians University of California, Berkeley faculty Harvard University alumni 1954 births {{US-mathematician-stub