The existence of a near-unanimity term in a finite algebra is decidable
Miklós Maróti · Journal of Symbolic Logic · 2009
Abstract We prove that it is decidable of a finite algebra whether it has a near-unanimity term operation, which settles a ten-year-old problem. As a consequence, it is decidable of a finite algebra in a congruence distributive variety whether it admits a natural duality.