Computably Enumerable Equivalence Relations
Logic
2010-12-07 v1
Abstract
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
Keywords
Cite
@article{arxiv.1012.0944,
title = {Computably Enumerable Equivalence Relations},
author = {Su Gao and Peter Gerdes},
journal= {arXiv preprint arXiv:1012.0944},
year = {2010}
}