Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 74, Issue 3 (2009), 1001-1014.
The existence of a near-unanimity term in a finite algebra is decidable
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.
J. Symbolic Logic, Volume 74, Issue 3 (2009), 1001-1014.
First available in Project Euclid: 16 June 2009
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Maróti, Miklós. The existence of a near-unanimity term in a finite algebra is decidable. J. Symbolic Logic 74 (2009), no. 3, 1001--1014. doi:10.2178/jsl/1245158096. https://projecteuclid.org/euclid.jsl/1245158096