Abstract

		Global properties of degree structures
		Andre Nies, The University of Chicago

We study degree structures from computability theory under the following
aspects: automorphism bases, biinterpretability with the natural numbers
in parameters, the question of whether they form a prime model, and
definable subsets. 

We mostly consider the c.e. Turing and many-one degrees. The main open
question here is whether the c.e. Turing degrees are bi-interpretable with
the natural numbers.