
arXiv: 1704.05587
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
FOS: Computer and information sciences, Computer Science - Computational Complexity, Electronic computers. Computer science, QA1-939, QA75.5-76.95, Computational Complexity (cs.CC), Mathematics
FOS: Computer and information sciences, Computer Science - Computational Complexity, Electronic computers. Computer science, QA1-939, QA75.5-76.95, Computational Complexity (cs.CC), Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
