It is well known that lattice-valued rough sets are important branches of fuzzy sets. The axiomatic characterization and related topology the main research directions For L=(L,⊛), a complete co-residuated lattice (CCRL), Qiao recently defined an L-fuzzy lower approximation operator (LFLAO) on basis relation. In this article, we give further study Qiao’s LFLAO around induced L-topology. Firstly,...

In [1] the authors considered finitely-valued modal logics with Kripke style semantics where both propositions and the accessibility relation are valued over a finite residuated lattice. Unfortunately, the necessity operator does not satisfy in general the normality axiom (K). In this paper we focus on the case of finite chains, and we consider a different approach based on introducing a multim...

The existence of lateral completions of `-groups is an old problem that was first solved, for conditionally complete vector lattices, by Nakano [5]. The existence and uniqueness of lateral completions of representable `-groups was first obtained as a consequence of the orthocompletions of Bernau [1], and later the proofs were simplified by Conrad [3], who also proved the existence and uniquenes...

In this paper we investigate the atomic level in the lattice of subvarieties of residuated lattices. In particular, we give infinitely many commutative atoms and construct continuum many non-commutative, representable atoms that satisfy the idempotent law; this answers Problem 8.6 of [12]. Moreover, we show that there are only two commutative idempotent atoms and only two cancellative atoms. Fi...

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...

We show that every idempotent weakly divisible residuated lattice satisfying the double negation law can be transformed into an orthomodular lattice. The converse holds if adjointness is replaced by conditional adjointness. Moreover, we show that every positive right residuated lattice satisfying the double negation law and two further simple identities can be converted into an orthomodular lat...

In this paper, we investigate the properties of join preserving maps in complete residuated lattices. We define join approximation operators as a generalization of fuzzy rough sets in complete residuated lattices. Moreover, we investigate the relations between join preserving operators and Alexandrov fuzzy topologies. We give their examples. AMS Subject Classification: 03E72, 03G10, 06A15, 06F07

In this paper, we consider the problem of solving systems of fuzzy relation equations in a space with fuzzy preorder. Two types of these systems with different compositions are considered. New solvability criteria are proposed for systems of both types. The new criteria are weaker than all the known ones that are based on the assumption that fuzzy sets on the left-hand side of a system establis...

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.