Quasi-equational bases for graphs of semigroups, monoids and groups.

DOI10.1007/s00233-010-9268-4zbMath1228.20045OpenAlexW1967998534MaRDI QIDQ535220

Michał M. Stronkowski

Publication date: 11 May 2011

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-010-9268-4

zbMATH Keywords

finite axiomatizabilityfinite quasi-equational basesgraphs of semigroupsquasivarieties of relational structures

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Quasivarieties (08C15)

Related Items (3)

Axiomatizations of universal classes through infinitary logic ⋮ Constraint satisfaction, irredundant axiomatisability and continuous colouring ⋮ Boolean topological graphs of semigroups: the lack of first-order axiomatization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasiidentities of two-element algebras
• A proof of Lyndon's finite basis theorem
• 2-element matrices
• On classes of relations and graphs determined by subobjects and factorobjects
• Finitely axiomatizable quasivarieties of graphs
• On digraph coloring problems and treewidth duality
• Homomorphism preservation theorems
• Relatively inherently nonfinitely q-based semigroups
• The Number of Semigroups of Order n
• Dualities for Constraint Satisfaction Problems
• Identities in Two-Valued Calculi
• PRIMITIVE POSITIVE FORMULAS PREVENTING A FINITE BASIS OF QUASI-EQUATIONS

This page was built for publication: Quasi-equational bases for graphs of semigroups, monoids and groups.