A note on the degree structure of primitive recursive m-reducibility
Abstract
Let Cprm be the upper semilattice of degrees of computable sets with respect to primitive recursive m-reducibility. We prove that the first-order theory of Cprm is hereditarily undecidable.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.