Quasi-equational bases for graphs of semigroups, monoids and groups. (Q535220): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On digraph coloring problems and treewidth duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Lyndon's finite basis theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualities for Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely axiomatizable quasivarieties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMITIVE POSITIVE FORMULAS PREVENTING A FINITE BASIS OF QUASI-EQUATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiidentities of two-element algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively inherently nonfinitely q-based semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Semigroups of Order n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identities in Two-Valued Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of relations and graphs determined by subobjects and factorobjects / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-element matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism preservation theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5833216 / rank
 
Normal rank

Latest revision as of 01:39, 4 July 2024

scientific article
Language Label Description Also known as
English
Quasi-equational bases for graphs of semigroups, monoids and groups.
scientific article

    Statements

    Quasi-equational bases for graphs of semigroups, monoids and groups. (English)
    0 references
    11 May 2011
    0 references
    The graph of an algebra \(\mathbf A\) is the relational structure \(G(\mathbf A)\) in which the relations are the graphs of the basic operations of \(\mathbf A\). Denote by \(G(\mathcal K)\) the class of all graphs of algebras from a class \(\mathcal K\). The author proves that if \(\mathcal K\) is a class of semigroups possessing a nontrivial member with a neutral element, then \(G(\mathcal K)\) does not have finite quasi-equational bases. As a corollary of this result, a similar result for a nontrivial class \(\mathcal K\) of monoids or groups is received. For contrast the author marks, that if \(\mathcal K\) is a nontrivial class of semigroups with zero multiplication, then the class \(G(\mathcal K)\) has a quasi-equational basis consisting of two quasi-identities.
    0 references
    0 references
    0 references
    0 references
    0 references
    graphs of semigroups
    0 references
    finite axiomatizability
    0 references
    finite quasi-equational bases
    0 references
    quasivarieties of relational structures
    0 references
    0 references