A note on the degree structure of primitive recursive m-reducibility
arXiv:2311.15253 · doi:10.1093/logcom/exae074
Abstract
Let be the upper semilattice of degrees of computable sets with respect to primitive recursive -reducibility. We prove that the first-order theory of is hereditarily undecidable.
13 pages