zbMATH — the first resource for mathematics

The existence of a near-unanimity term in a finite algebra is decidable. (English) Zbl 1174.08002
Near-unanimity operations are characterized by the identities \[ f(y,x,\dots,x) = f(x,y,x,\dots,x) = \dots = f(x,\dots,x,y) = x. \] B. A. Davey, L. Heindorf, and R. McKenzie [Algebra Univers. 33, No. 3, 428–439 (1995; Zbl 0824.08007)] posed the problem whether having a near-unanimity term operation is a decidable property of finite algebras. From the affirmative solution elaborated in the present paper also follows the decidability of the natural duality problem for finite algebras in congruence distributive varieties.

08A40 Operations and polynomials in algebraic structures, primal algebras
08B10 Congruence modularity, congruence distributivity
03B25 Decidability of theories and sets of sentences
Full Text: DOI
[1] Contributions to Lattice Theory {Szeged, 1980) 33 pp 101– (1983)}
[2] DOI: 10.1007/BF01190710 · Zbl 0824.08007
[3] DOI: 10.1007/3-540-45022-X_24
[4] DOI: 10.1007/BF01187059 · Zbl 0292.08004
[5] DOI: 10.1007/s00012-008-2122-9 · Zbl 1186.08003
[6] DOI: 10.1137/S0097539794266766 · Zbl 0914.68075
[7] DOI: 10.1007/s00012-007-2037-x · Zbl 1136.08003
[8] Function algebras on finite sets: Basic course on many-valued logic and clone theory (2006) · Zbl 1105.08001
[9] DOI: 10.1016/S0004-3702(98)00022-8 · Zbl 0909.68076
[10] Proceedings of 22nd Logic in Computer Science pp 213– (2007)
[11] DOI: 10.1016/0097-3165(78)90022-5 · Zbl 0418.05028
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.