Abstract.   We prove that every countable relation on the enumeration degrees, , is uniformly definable from parameters in . Consequently, the first order theory of is recursively isomorphic to the second order theory of arithmetic. By an effective version of coding lemma, we show that the first order theory of the enumeration degrees of the sets is not decidable.