Computability in the Lattice of Equivalence Relations
Computational Complexity
2017-04-20 v1
Abstract
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time decidable equivalence relations- form sublattices of the lattice.
Keywords
Cite
@article{arxiv.1704.05587,
title = {Computability in the Lattice of Equivalence Relations},
author = {Jean-Yves Moyen and Jakob Grue Simonsen},
journal= {arXiv preprint arXiv:1704.05587},
year = {2017}
}
Comments
In Proceedings DICE-FOPARA 2017, arXiv:1704.05169