Finitely related algebras in congruence distributive varieties have near unanimity terms
DOI10.4153/CJM-2011-087-3zbMATH Open1283.08009MaRDI QIDQ4907620FDOQ4907620
Authors: Libor Barto 
Publication date: 4 February 2013
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Recommendations
constraint satisfaction problemrelational structurecongruence distributive varietyfinitely related algebranear unanimity operationJonsson operations
Relational systems, laws of composition (08A02) Equational logic, Mal'tsev conditions (08B05) Congruence modularity, congruence distributivity (08B10)
Cited In (36)
- Title not available (Why is that?)
- Finite regular bands are finitely related.
- Relations compatible with near unanimity operations
- On finitely related semigroups.
- On tractability and congruence distributivity
- On the number of finite algebraic structures
- Finite degree clones are undecidable
- Tractability in constraint satisfaction problems: a survey
- 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
- \(n\)-permutability and linear Datalog implies symmetric Datalog
- Decidability of absorption in relational structures of bounded width.
- Pseudo‐loop conditions
- Finite degree: algebras in general and semigroups in particular
- Dualities and algebras with a near-unanimity term
- Binarisation for valued constraint satisfaction problems
- The smallest hard trees
- Absorption and directed Jónsson terms
- Preserving near unanimity terms under products
- When symmetries are not enough: a hierarchy of hard constraint satisfaction problems
- Congruence distributivity implies bounded width
- The structure of polynomial operations associated with smooth digraphs.
- Existence of cube terms in finite algebras
- Cube term blockers without finiteness
- Few subpowers, congruence distributivity and near-unanimity terms
- Mitschke's theorem is sharp
- Deciding absorption in relational structures
- Absorption in universal algebra and CSP
- The existence of a near-unanimity term in a finite algebra is decidable
- The lattice of clones of self-dual operations collapsed
- Robust algorithms with polynomial loss for near-unanimity CSPs
- 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
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)
