Finitely related algebras in congruence distributive varieties have near unanimity terms
From MaRDI portal
(Redirected from Publication:4907620)
Recommendations
Cited in
(37)- scientific article; zbMATH DE number 4045812 (Why is no real title available?)
- Relations compatible with near unanimity operations
- On finitely related semigroups.
- On the number of finite algebraic structures
- On tractability and congruence distributivity
- Tractability in constraint satisfaction problems: a survey
- Finite degree clones are undecidable
- Quasiorder lattices of varieties
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- 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
- Finite degree: algebras in general and semigroups in particular
- Decidability of absorption in relational structures of bounded width.
- Pseudo‐loop conditions
- Dualities and algebras with a near-unanimity term
- Binarisation for valued constraint satisfaction problems
- The smallest hard trees
- Hrushovski's encoding and -categorical CSP monsters
- Sensitive instances of the constraint satisfaction problem
- Preserving near unanimity terms under products
- Absorption and directed Jónsson terms
- 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
- Approximate distributive laws and finite equational bases for finite algebras in congruence-distributive varieties
- Not all nilpotent monoids are finitely related
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)
