Finitary Reducibility on Equivalence Relations
We introduce the notion of finitary computable reducibility on equivalence relations on the domain ω. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be Π_(n+2)^0-complete under comp...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2016
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/84705 http://hdl.handle.net/10220/41955 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|