The Complexity Of Index Sets Of Classes Of Computably Enumerable Equivalence Relations
Work
Year: 2016
Type: article
Abstract: Let $ \le _c $ be computable the reducibility on computably enumerable equivalence relations (or ceers). We show that for every ceer R with infinitely many equivalence classes, the index sets $\left\... more
Source: Journal of Symbolic Logic
Authors Uri Andrews, Andrea Sorbi
Institutions University of Wisconsin–Madison, University of Siena
Cites: 21
Cited by: 9
Related to: 10
FWCI: 0.905
Citation percentile (by year/subfield): 71.02
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green