Publisher： Cambridge University Press
E-ISSN： 1943-5886|74|3|1001-1014
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.74, Iss.3, 2009-09, pp. : 1001-1014
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
Jónsson Terms and Near-Unanimity Functions in Finite Posets
Order, Vol. 20, Iss. 4, 2003-11 ,pp. :
Access to resources
Recommend
Few subpowers, congruence distributivity and near-unanimity terms
algebra universalis, Vol. 58, Iss. 2, 2008-03 ,pp. :
Posets, near unanimity functions and zigzags
Bulletin of the Australian Mathematical Society, Vol. 47, Iss. 1, 1993-02 ,pp. :
Decidable properties of finite sets of equations in trivial languages
The Journal of Symbolic Logic, Vol. 49, Iss. 4, 1984-12 ,pp. :