Interpreting true arithmetic in the local structure of the enumeration degrees

Abstract

We show that the theory of the local structure of the enumeration degrees is computably isomorphic to the theory of first order arithmetic. We introduce a novel coding method, using the notion of a $\mathcal{K}$-pair, to code a large class of countable relations.