A note on the degree structure of primitive recursive m-reducibility
Logic
2025-04-29 v1
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.
Keywords
Cite
@article{arxiv.2311.15253,
title = {A note on the degree structure of primitive recursive m-reducibility},
author = {Birzhan Kalmurzayev and Nikolay Bazhenov and Alibek Iskakov},
journal= {arXiv preprint arXiv:2311.15253},
year = {2025}
}
Comments
13 pages