DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS

DOI10.1017/jsl.2019.73zbMath1497.08003arXiv1704.05928OpenAlexW2609834214MaRDI QIDQ5148097

Alexandr Kazda, Matthew A. Valeriote

Publication date: 29 January 2021

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.05928

zbMATH Keywords

computational complexityuniversal algebraMal'tsev condition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Equational logic, Mal'tsev conditions (08B05) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (6)

Local–global property for G-invariant terms ⋮ Unnamed Item ⋮ Deciding the Existence of Minority Terms ⋮ Testing for a semilattice term ⋮ Mal'tsev condition satisfaction problems for conditions which imply edge terms ⋮ Between an n-ary and an n + 1-ary near-unanimity term

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The wonderland of reflections
• On \(n\)-permutable congruences
• COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• Geometrical methods in congruence modular algebras
• The lattice of interpretability types of varieties
• ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
• The structure of finite algebras
• Absorption and directed Jónsson terms
• Asking the Metaquestions in Constraint Tractability
• The shape of congruence lattices
• Deciding the Existence of Minority Terms
• Idempotent n -permutable varieties
• Algebras Whose Congruence Lattices are Distributive.
• A Characterization of Modularity for Congruence Lattices of Algebras*

This page was built for publication: DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS