Near-unanimity is decomposable (Q2496166)

A \(k\)-ary near-unanimity term is a term \(n(x_1,\dots ,x_k)\) which obeys the law \[ n(x,\dots ,x,y,x,\dots ,x)=x \] for all possible positions of \(y\). It is well-know that each variety having a near-unanimity term is congruence distributive. The author proves that in the interpretability lattice, the varieties possessing a near-unanimity term constitute a filter that is the proper intersection of two larger filters, one of them is the filter of congruence modular varieties.