The weakest nontrivial idempotent equations
arXiv:1609.00531 · doi:10.1112/blms.12097
Abstract
An equational condition is a set of equations in an algebraic language, and an algebraic structure satisfies such a condition if it possesses terms that meet the required equations. We find a single nontrivial equational condition which is implied by any nontrivial idempotent equational condition.
Cited by in corpus (8)
- Algebraic approach to promise constraint satisfaction
- ω-categorical structures avoiding height 1 identities
- Pseudo-loop conditions
- Mitschke's Theorem is sharp
- Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)
- Maltsev conditions for general congruence meet-semidistributive algebras
- Free-lattice functors weakly preserve epi-pullbacks
- Varieties defined by linear equations have the amalgamation property