The paper presents results on approximation in residuated lattices given that closeness is assessed by means of biresiduum. We describe central points and optimal central points of subsets of residuated lattices and provide properties of these points. In addition, we present algorithms for two problems regarding optimal approximation.

In this paper we investigate various properties of equivalence classes of fuzzy equivalence relations over a complete residuated lattice. We give certain characterizations of fuzzy semipartitions and fuzzy partitions over a complete residuated lattice, as well as over a linearly ordered complete Heyting algebra. In the latter case, for a fuzzy equivalence relation over a linearly ordered comple...

We show that the size reduction problem for fuzzy automata is related to the problem of solving a particular system of fuzzy relation equations. This system consists of infinitely many equations, and finding its general solution is a very difficult task, so we first consider one of its special cases, a finite system whose solutions, called right invariant fuzzy equivalences, are common generali...

Formal concept analysis is a particular method of analysis of relational data. In addition to tools for data analysis, formal concept analysis provides elaborated mathematical foundations for relational data. In the course of the last decade, several attempts appeared to extend formal concept analysis to data with graded (fuzzy) attributes. Among these attempts, an approach based on residuated ...

We extend Cayley’s and Holland’s representation theorems to idempotent semirings and residuated lattices, and provide both functional and relational versions. Our analysis allows for extensions of the results to situations where conditions are imposed on the order relation of the representing structures. Moreover, we give a new proof of the finite embeddability property for the variety of integ...

K–axiom–based epistemic closure for explicit knowledge is rejected for even the most trivial cases of deductive inferential reasoning on account of the fact that the closure axiom does not extend beyond a raw consequence relation. The recognition that deductive inference concerns interaction as much as it concerns consequence allows for perspectives from logics of multi–agent information flow t...

It is well-known that the representation of several classes of residuated lattices involves lattice-ordered groups. An often applicable method to determine the representing group (or groups) from a residuated lattice is based on partial algebras: the monoidal operation is restricted to those pairs which fulfil a certain extremality condition, and else left undefined. The subsequent construction...

Recently, Molodtsov [12] introduced the soft set as a mathematical tool for dealing information as the uncertainty of data in engineering, physics, computer sciences and many other diverse field. Presently, the soft set theory is making progress rapidly [1,3]. Pawlak’s rough set [13,14] can be viewed as a special case of soft rough sets [3]. The topological structures of soft sets have been dev...

In this paper, we investigate the properties of join and meet preserving maps in complete residuated lattice using Zhang’s the fuzzy complete lattice which is defined by join and meet on fuzzy posets. We define L-upper (resp. L-lower) approximation operators as a generalization of fuzzy rough sets in complete residuated lattices. Moreover, we investigate the relations between L-upper (resp. L-l...

Residuation is a fundamental concept of ordered structures and categories. In this survey we consider the consequences of adding a residuated monoid operation to lattices. The resulting residuated lattices have been studied in several branches of mathematics, including the areas of lattice-ordered groups, ideal lattices of rings, linear logic and multi-valued logic. Our exposition aims to cover...