CD(4) has bounded width
- First Online:
- Cite this article as:
- Carvalho, C., Dalmau, V., Marković, P. et al. Algebra univers. (2009) 60: 293. doi:10.1007/s00012-009-2113-5
- 40 Downloads
We prove that the constraint languages invariant under a short sequence of Jónsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they have bounded width. This improves a previous result by Kiss and Valeriote and presents some evidence that the Larose–Zádori conjecture holds in the congruence-distributive case.