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: | Miller, Russell, Ng, Keng Meng |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/84705 http://hdl.handle.net/10220/41955 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Reducibilities among equivalence relations induced by recursively enumerable structures
by: Gavryushkin A., et al.
Published: (2020) -
Graphs realised by r.e. equivalence relations
by: Gavruskin, A., et al.
Published: (2014) -
A reducibility related to being hyperimmune-free
by: Stephan, F., et al.
Published: (2014) -
Diet and exercise expert system
by: Chua, James L., et al.
Published: (1998) -
Complexity of equivalence relations and preorders from computability theory
by: Ianovski, Egor, et al.
Published: (2015)