Finitely Related Algebras in Congruence Distributive Varieties Have Near Unanimity Terms

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10174102" target="_blank" >RIV/00216208:11320/13:10174102 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4153/CJM-2011-087-3" target="_blank" >http://dx.doi.org/10.4153/CJM-2011-087-3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4153/CJM-2011-087-3" target="_blank" >10.4153/CJM-2011-087-3</a>

Result language
angličtina
Original language name
Finitely Related Algebras in Congruence Distributive Varieties Have Near Unanimity Terms
Original language description
We show that every finite, finitely related algebra in a congruence distributive variety has a near unanimity term operation. As a consequence we solve the near unanimity problem for relational structures: it is decidable whether a given finite set of relations on a finite set admits a compatible near unanimity operation. This consequence also implies that it is decidable whether a given finite constraint language defines a constraint satisfaction problem of bounded strict width.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GP201%2F09%2FP223" target="_blank" >GP201/09/P223: Constraint satisfaction problem and universal algebra</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)