# A quasi-Mal’cev condition with unexpected application

@article{Wires2015AQC, title={A quasi-Mal’cev condition with unexpected application}, author={A. Wires}, journal={Algebra universalis}, year={2015}, volume={73}, pages={335-346} }

A quasi-Mal’cev condition for quasivarieties is established which in the case of locally finite quasivarieties forbids strongly abelian congruences and for varieties is equivalent to possessing a weak-difference term. We then look at two wellknown theorems concerning constraint satisfaction and the closure of finite digraphs under a Taylor operation.

#### 3 Citations

Algebra and the Complexity of Digraph CSPs: a Survey

- Computer Science
- The Constraint Satisfaction Problem
- 2017

#### References

SHOWING 1-10 OF 25 REFERENCES

A finite basis theorem for residually finite, congruence meet-semidistributive varieties

- Mathematics, Computer Science
- Journal of Symbolic Logic
- 2000

Residually finite, congruence meet-semidistributive varieties of finite type have a finite residual bound

- Mathematics
- 1999

Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem

- Mathematics, Computer Science
- Log. Methods Comput. Sci.
- 2012

The Relationship Between Two Commutators

- Mathematics, Computer Science
- Int. J. Algebra Comput.
- 1998