A. Nies et Ra. Shore, INTERPRETING TRUE ARITHMETIC IN THE THEORY OF THE RE TRUTH TABLE DEGREES, Annals of pure and applied Logic, 75(3), 1995, pp. 269-311
We show that the elementary theory of the recursively enumerable tt-de
grees has the same computational complexity as true first-order arithm
etic. As auxiliary results, we prove theorems about exact pairs and in
itial segments in the tt-degrees.