In 1998, Hájek established a representation theorem of BL-algebrs as all subdirect products of linear BL-algebrs. We establish a similar result for the much wider class of prelinear residuated algebras, in which neither the lattice structure nor the divisibility of the monoid operation is assumed. We show, in the case of prelinear residuated lattices, that this order embedding becomes a lattice...

Cancellative residuated lattices are a natural generalization of lattice-ordered groups (`-groups). Although cancellative monoids are defined by quasi-equations, the class CanRL of cancellative residuated lattices is a variety. We prove that there are only two commutative subvarieties of CanRL that cover the trivial variety, namely the varieties generated by the integers and the negative intege...

This work is towards the study of the relationship between fuzzy preordered sets and Alexandrov (left/right) fuzzy topologies based on generalized residuated lattices here the fuzzy sets are equipped with generalized residuated lattice in which the commutative property doesn't hold. Further, the obtained results are used in the study of fuzzy automata theory.

In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follows, including various types of completeness theorems of substructural logics.

Continuing with our general study of algebraic hyperstructures, we focus on the residuated operation in the framework of multilattices. Firstly, we recall the existing relation between filters, homomorphisms and congruences in the framework of multilattices; then, introduce the notion of residuated multilattice and further study the notion of filter, which has to be suitably modified so that th...

We introduce the concept of very true operator on an effect algebra. Although an effect algebra is only partial, we define it in the way which is in accordance with traditional definitions in residuated lattices or basic algebras. This is possible if we require monotonicity as an additional condition. We prove that very true operators on effect algebras can be characterized by means of certain ...

In this chapter we survey some developments in topological duality theory and the theory of completions for lattices with additional operations paying special attention to various classes of residuated lattices which play a central role in substructural logic. We hope this chapter will serve as an introduction and invitation to these subjects for researchers and students interested in residuate...

We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semantics of a large family of substructural and fuzzy logics [13, 15], and are therefore natural candidates for this role. As a preliminary evidence in support to our claim, along the lines of Cooper et al. and Larrosa et a...

In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sph...