Partial ordering and congruences on LA-semigroups (Q810643)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Partial ordering and congruences on LA-semigroups
scientific article

    Statements

    Partial ordering and congruences on LA-semigroups (English)
    0 references
    0 references
    1991
    0 references
    A left almost semigroup (LA-semigroup, for short) is a groupoid satisfying the left invertive law \((ab)c=(cb)a\) and one of the equivalent weak associative laws \((ab)c=b(ca)\) or \((ab)c=b(ac)\). An LA-semigroup S is called inverse if for every \(a\in S\) there is \(a'\in S\) (an inverse of a) such that \((aa')a=a\) and \((a'a)a'=a'\). The present paper studies properties of compatible partial orderings and of congruences on inverse LA-semigroups. In particular, the greatest idempotent-separating congruence on an inverse LA-semigroup is described in detail.
    0 references
    0 references
    0 references
    0 references
    0 references
    left almost semigroup
    0 references
    groupoid
    0 references
    left invertive law
    0 references
    weak associative laws
    0 references
    partial orderings
    0 references
    congruences
    0 references
    inverse LA-semigroups
    0 references