Near-unanimity is decomposable

DOI10.1007/S00012-003-1830-4zbMATH Open1092.08002OpenAlexW2073916645MaRDI QIDQ2496166FDOQ2496166

Authors: Luís Sequeira 

Publication date: 12 July 2006

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-003-1830-4

Recommendations

• On the (un)decidability of a near-unanimity term
• An example of a congruence distributive variety having no near-unanimity term
• scientific article; zbMATH DE number 4045812
• The lattice of interpretability types of varieties
• The existence of a near-unanimity term in a finite algebra is decidable

zbMATH Keywords

Mal'tsev conditionsinterpretability of varieties

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Congruence modularity, congruence distributivity (08B10)

Cited In (7)

• Between an n-ary and an n + 1-ary near-unanimity term
• Preserving near unanimity terms under products
• Existence of cube terms in finite algebras
• Varieties with few subalgebras of powers
• Mitschke's theorem is sharp
• Taylor's modularity conjecture holds for linear idempotent varieties.
• An example of a congruence distributive variety having no near-unanimity term

This page was built for publication: Near-unanimity is decomposable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496166)