@inproceedings{c32336a4b93745f4bd04f8d55c4a8bdd,
title = "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.",
author = "Jean-Yves Moyen and Simonsen, {Jakob Grue}",
year = "2017",
month = apr,
day = "18",
doi = "10.4204/EPTCS.248.8",
language = "English",
series = "Electronic Proceedings in Theoretical Computer Science",
publisher = "Open Publishing Association",
pages = "38--46",
editor = "Guillaume Bonfante and Georg Moser",
booktitle = "Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis",
note = "8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis ; Conference date: 22-04-2017 Through 23-04-2017",
}