Resumen de On the (un)decidability of a near-unanimity term

Miklós Maróti

• We investigate the near-unanimity problem: given a finite algebra, decide if it has a near-unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a partial near-unanimity term on its underlying set excluding two fixed elements. On the other hand, based on Rosenberg�s characterization of maximal clones, we present partial results towards proving the decidability of the general problem.