Lyndon's groupoid is not inherently nonfinitely based

DOI10.1007/BF01182458zbMath0703.08005MaRDI QIDQ915755

Tamás Bajusz, Ágnes Szendrei, George F. McNulty

Publication date: 1990

Published in: Algebra Universalis (Search for Journal in Brave)

zbMATH Keywords

inherently nonfinitely basedLyndon's algebra

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05)

Related Items

The Division Relation: Congruence Conditions and Axiomatisability ⋮ EVERY SHIFT AUTOMORPHISM VARIETY HAS AN INFINITE SUBDIRECTLY IRREDUCIBLE MEMBER ⋮ Nonfinitely based pseudovarieties and inherently nonfinitely based varieties ⋮ The equational complexity of Lyndon's algebra ⋮ EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Basic questions for general algebras
• Nonfinitely based three-element idempotent groupoids
• Finite equational bases for congruence modular varieties
• Laws in finite loops
• A four-element algebra whose identities are not finitely based
• Finite equational bases for finite algebras in a congruence-distributive equational class
• Identities satisfied by a finite ring
• Bases for equational theories of semi-groups
• PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS
• Equational Bases for Lattice Theories.
• Identities in Two-Valued Calculi
• Identities in Finite Algebras
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)