On the (un)decidability of a near-unanimity term
- First Online:
- Cite this article as:
- Maróti, M. Algebra univers. (2007) 57: 215. doi:10.1007/s00012-007-2037-x
- 27 Downloads
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.