Finitely related algebras in congruence distributive varieties have near unanimity terms

DOI10.4153/CJM-2011-087-3zbMATH Open1283.08009MaRDI QIDQ4907620FDOQ4907620

Publication date: 4 February 2013

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Recommendations

The existence of a near-unanimity term in a finite algebra is decidable
scientific article; zbMATH DE number 3787
On the (un)decidability of a near-unanimity term
Near unanimity: An obstacle to general duality theory
scientific article

constraint satisfaction problem relational structure congruence distributive variety finitely related algebra near unanimity operation Jonsson operations

Mathematics Subject Classification ID

Relational systems, laws of composition (08A02) Equational logic, Mal'tsev conditions (08B05) Congruence modularity, congruence distributivity (08B10)

Cited In (31)

Title not available (Why is that?)
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs
Relations compatible with near unanimity operations
On finitely related semigroups.
On the number of finite algebraic structures
Finite degree clones are undecidable
Tractability in constraint satisfaction problems: a survey
Binarisation for Valued Constraint Satisfaction Problems
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems
Finite bands are finitely related
Quasiorder lattices of varieties
Title not available (Why is that?)
Between an n-ary and an n + 1-ary near-unanimity term
Menger systems of idempotent cyclic and weak near-unanimity multiplace functions
Decidability of absorption in relational structures of bounded width.
Pseudo‐loop conditions
Finite degree: algebras in general and semigroups in particular
Title not available (Why is that?)
The smallest hard trees
Absorption and directed Jónsson terms
Preserving near unanimity terms under products
The structure of polynomial operations associated with smooth digraphs.
Cube term blockers without finiteness
Mitschke's theorem is sharp
Deciding absorption in relational structures
The existence of a near-unanimity term in a finite algebra is decidable
The lattice of clones of self-dual operations collapsed
The existence of a near-unanimity function is decidable
Not all nilpotent monoids are finitely related
Approximate distributive laws and finite equational bases for finite algebras in congruence-distributive varieties
Title not available (Why is that?)

This page was built for publication: Finitely related algebras in congruence distributive varieties have near unanimity terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907620)