Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2405.15281 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913361215619072 |
|---|---|
| author | Mourad, Daniel |
| author_facet | Mourad, Daniel |
| contents | We show that, in general, there is no degree corresponding to the composition of two problems in the computable reducibility lattice. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_15281 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | There is No Composition in the Computable Reducibility Degrees Mourad, Daniel Logic 03D30 03B30 We show that, in general, there is no degree corresponding to the composition of two problems in the computable reducibility lattice. |
| title | There is No Composition in the Computable Reducibility Degrees |
| topic | Logic 03D30 03B30 |
| url | https://arxiv.org/abs/2405.15281 |