the aim of this paper is to extend results established by h. onoand t. kowalski regarding directly indecomposable commutative residuatedlattices to the non-commutative case. the main theorem states that a residuatedlattice a is directly indecomposable if and only if its boolean center b(a)is {0, 1}. we also prove that any linearly ordered residuated lattice and anylocal residuated lattice are d...

C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted ~K,,.,. In this paper, we generalize his work by defining a new operation on ordered pairs of lattices called shuffling. L1 shuffle L2 is denoted by L 1 M L2. The resulting L 1 M L 2 are not necessarily lattices but are posets. The lattices ~/U~, n correspond to the special cases N, ~ Nm. In this paper,...

Suppose <? denotes a class of totally ordered groups closed under taking subgroups and quotients by o-homomorphisms. We study the following classes: (1) Res (£?), the class of all lattice-ordered groups which are subdirect products of groups in C; (2) Hyp(C), the class of lattice-ordered groups in Res(C) having all their ¿-homomorphic images in Res(<?); Para(C), the class of lattice-ordered gro...

Proof theory can provide useful tools for tackling problems in algebra. In particular, Gentzen systems admitting cut-elimination have been used to establish decidability, complexity, amalgamation, admissibility, and generation results for varieties of residuated lattices corresponding to substructural logics. However, for classes of algebras bearing some family resemblance to groups, such as la...

we consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $x$, $(x, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $x$. we also show that, for a strong residuated lattice $x$, $bigcap {p_{lambda} ,|,p_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...