Testing for a semilattice term

DOI10.1007/S11083-018-9455-6zbMath1439.08006OpenAlexW2793464978WikidataQ130122823 ScholiaQ130122823MaRDI QIDQ1732802

J. B. Nation, Ralph Freese, Matthew A. Valeriote

Publication date: 25 March 2019

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-018-9455-6

zbMATH Keywords

computational complexityidempotent algebrasemilattice term

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Semilattices (06A12)

Related Items (1)

Mal'tsev condition satisfaction problems for conditions which imply edge terms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple equations on real intervals
• Congruence-distributive polynomial reducts of lattices
• COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS
• ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
• COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
• The structure of finite algebras
• The shape of congruence lattices
• DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS
• Idempotent n -permutable varieties
• Algebras Whose Congruence Lattices are Distributive.

This page was built for publication: Testing for a semilattice term