Testing for a semilattice term
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Algebras Whose Congruence Lattices are Distributive.
- COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
- Computational complexity of various Mal'cev conditions
- Congruence-distributive polynomial reducts of lattices
- DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS
- Idempotent \(n\)-permutable varieties.
- ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
- Simple equations on real intervals
- The shape of congruence lattices
- The structure of finite algebras
- Universal algebra. Fundamentals and selected topics
Cited in
(5)
This page was built for publication: Testing for a semilattice term
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732802)