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

Birzhan Kalmurzayev, Nikolay A. Bazhenov, Alibek M Iskakov · arXiv (Cornell University) · 2023

Let $C^{pr}_m$ 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^{pr}_m$ is hereditarily undecidable.

Read the paper · More papers on PaperTik