Computability in the Lattice of Equivalence Relations
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2017
- DOI:
- 10.48550/arXiv.1704.05587
- arXiv:
- arXiv:1704.05587
- Bibcode:
- 2017arXiv170405587M
- Keywords:
-
- Computer Science - Computational Complexity
- E-Print:
- In Proceedings DICE-FOPARA 2017, arXiv:1704.05169