A note on the degree structure of primitive recursive m-reducibility
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916707712368640 |
|---|---|
| author | Kalmurzayev, Birzhan Bazhenov, Nikolay Iskakov, Alibek |
| author_facet | Kalmurzayev, Birzhan Bazhenov, Nikolay Iskakov, Alibek |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_15253 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A note on the degree structure of primitive recursive m-reducibility Kalmurzayev, Birzhan Bazhenov, Nikolay Iskakov, Alibek Logic 03D30, 03D20 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. |
| title | A note on the degree structure of primitive recursive m-reducibility |
| topic | Logic 03D30, 03D20 |
| url | https://arxiv.org/abs/2311.15253 |