Computability in the Lattice of Equivalence Relations
arXiv:1704.05587 · doi:10.4204/EPTCS.248.8
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.
In Proceedings DICE-FOPARA 2017, arXiv:1704.05169