Abstract.
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received February 21, 2005; accepted in final form November 25, 2006.
While working on this paper, the author was partially supported by the Hungarian National Foundation for Scientific Research (OTKA) grant nos. T 37877 and K 60148.
Rights and permissions
About this article
Cite this article
Maróti, M. On the (un)decidability of a near-unanimity term. Algebra univers. 57, 215–237 (2007). https://doi.org/10.1007/s00012-007-2037-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00012-007-2037-x