On the theory of the PTIME degrees of the recursive sets

An interpretation is given of first-order arithmetic in the theory of the PTIME degrees of the recursive sets, ordered under PTIME Turing reducibility (). This characterizes the Turing degree of the first-order theory of . In particular, it is not decidable.<>