Every linear pseudo BL-algebra admits a state (Q877764)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Every linear pseudo BL-algebra admits a state
scientific article

    Statements

    Every linear pseudo BL-algebra admits a state (English)
    0 references
    3 May 2007
    0 references
    The paper solves the problem whether there is a state on each linear pseudo BL-algebra. This question is equivalent to the existence of a maximal filter which is normal. Since there is always a unique maximal filter in each linear pseudo BL-algebra, it is sufficient to prove that it is normal. The author proves that this is really the case. It follows from this fact that each representable pseudo BL-algebra admits a state. Moreover, it is proved that each representable pseudo BL-algebra is good, i.e., the composition of left and right negation gives the same result as the reverse composition. This result is in fact a partial answer to the open problem whether each pseudo BL-algebra is good or not. Finally, the author proves that there is a maximal decomposition of a saturated linear pseudo BL-algebra as an ordinal sum of irreducible components.
    0 references
    0 references
    0 references
    0 references
    0 references
    pseudo BL-algebra
    0 references
    GBL-algebra
    0 references
    GMV-algebra
    0 references
    state
    0 references
    normal filter
    0 references
    0 references