Idempotent n -permutable varieties

DOI10.1112/blms/bdu044zbMath1303.08005OpenAlexW2167755906MaRDI QIDQ5495357

Ross Willard, Matthew A. Valeriote

Publication date: 4 August 2014

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/bdu044

zbMATH Keywords

\(n\)-permutabilitypolynomial-time algorithmsfinite idempotent algebrasvariety of distributive latticesidempotent varieties

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structure and representation theory of distributive lattices (06D05) Decidability of theories and sets of sentences (03B25) Equational logic, Mal'tsev conditions (08B05) Congruence modularity, congruence distributivity (08B10) Equational classes, universal algebra in model theory (03C05)

Related Items

Local–global property for G-invariant terms ⋮ Universal algebraic methods for non-classical logics ⋮ Deciding the Existence of Minority Terms ⋮ The wonderland of reflections ⋮ n-Permutability is not join-prime for n ≥ 5 ⋮ Testing for a semilattice term ⋮ DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS ⋮ Maltsev families of varieties closed under join or Maltsev product ⋮ Taylor's modularity conjecture and related problems for idempotent varieties ⋮ Mal'tsev condition satisfaction problems for conditions which imply edge terms ⋮ Polynomial-time tests for difference terms in idempotent varieties ⋮ On the use of majority for investigating primeness of 3-permutability

Cites Work

• Unnamed Item
• Unnamed Item
• Universal algebra and hardness results for constraint satisfaction problems
• Complete problems for deterministic polynomial time
• On \(n\)-permutable congruences
• Equations implying congruence \(n\)-permutability and semidistributivity.
• Kongruenzklassengeometrien
• COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
• COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
• The structure of finite algebras
• Varieties Obeying Homotopy Laws
• Classifying the Complexity of Constraints Using Finite Algebras
• Two Mal'cev-type theorems in universal algebra