6 citations · 20 across the 15 of their papers we have counts for
1 paper · 2 filters
Dmitriy Zhuk
We prove that the following problem is decidable: given a finite set of relations, decide whether this set admits a near-unanimity function.