The existence of a near-unanimity term in a finite algebra is decidable

DOI10.2178/jsl/1245158096zbMath1174.08002OpenAlexW2092845782MaRDI QIDQ3399189

Miklós Maróti

Publication date: 29 September 2009

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1245158096

zbMATH Keywords

decidabilityfinite algebraclone of operationsnear-unanimity operation

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Operations and polynomials in algebraic structures, primal algebras (08A40) Congruence modularity, congruence distributivity (08B10)

Related Items (6)

A short introduction to clones. ⋮ The existence of a near-unanimity function is decidable ⋮ Existence of cube terms in finite algebras ⋮ Finite degree clones are undecidable ⋮ Between an n-ary and an n + 1-ary near-unanimity term ⋮ Testing for edge terms is decidable

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Existence theorems for weakly symmetric operations
• Polynomial interpolation and the Chinese remainder theorem for algebraic systems
• Constraints, consistency and closure
• Near unanimity: An obstacle to general duality theory
• On the (un)decidability of a near-unanimity term
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Function Algebras on Finite Sets

This page was built for publication: The existence of a near-unanimity term in a finite algebra is decidable