On finite Taylor algebras

DOI10.1142/S0218196716500685zbMath1353.08003OpenAlexW2554612183MaRDI QIDQ2955410

Alexander Wires

Publication date: 25 January 2017

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196716500685

zbMATH Keywords

Mal'tsev conditionTaylor algebrahereditary characterization

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Structure theory of algebraic structures (08A05)

Related Items (1)

The equation solvability problem over supernilpotent algebras with Mal’cev term

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finitely related clones and algebras with cube terms.
• Cube term blockers without finiteness
• Generative complexity in algebra
• Varieties with few subalgebras of powers
• The structure of finite algebras
• Classifying the Complexity of Constraints Using Finite Algebras
• Tractability and Learnability Arising from Algebras with Few Subpowers
• The complexity of satisfiability problems
• Robust satisfiability of constraint satisfaction problems

This page was built for publication: On finite Taylor algebras