A note on the degree structure of primitive recursive m-reducibility

Let $C_m^{pr}$ be the upper semilattice of degrees of computable sets with respect to primitive recursive $m$-reducibility. We prove that the first-order theory of $C_m^{pr}$ is hereditarily undecidable.