Lattice-valued possibilistic measures, conceived and developed in more detail by G.*De Cooman in 1997 [3], enabled to apply the main ideas on which the real-valued possibilistic measures are founded also to the situations often occurring in the real world around, when the degrees of possibility, ascribed to various events charged by uncertainty, are comparable only quantitatively by the relatio...

This paper deals with the concept of complete residuated lattice-valued (referred to as L-valued) finite tree automata. In this regard, we first define an L-valued regular tree language, and then we prove a necessary and sufficient condition for the regularity of an L-valued tree language. Furthermore, we generalize the pumping lemma for L-valued finite tree automata (L-FTA). Afterwards, the be...

We define a regularity axiom for lattice-valued convergence spaces where the lattice is a complete Heyting algebra. To this end, we generalize the characterization of regularity by a ”dual form” of a diagonal condition. We show that our axiom ensures that a regular T1-space is separated and that regularity is preserved under initial constructions. Further we present an extension theorem for a c...

We present a procedure for constructing multi-valued tnorms and t-conorms. Our construction uses a pair of single-valued t-norms and the pair of dual t-conorms to construct interval-valued t-norms u and t-conorms t. In this manner we can combine desirable characteristics of different t-norms and t-conorms; furthermore if we use the t-norm ∧ and t-conorm ∨, then (X,u,t) is a superlattice, i.e. t...

We present a procedure for the construction of multi-valued t-norms and t-conorms. Our procedure makes use of a pair of single-valued t-norms and the respective dual t-conorms and produces interval-valued t-norms u and t-conorms t. In this manner we combine desirable characteristics of different t-norms and t-conorms; if we use the t-norm ∧ and t-conorm ∨, then (X,u,t) is a superlattice, i.e. t...

There is an intimate correlation between rough set theory and formal concept analysis theory, so rough set approximations can be realized by means of formal concept analysis. For any given multiple valued information system, the realization of rough set approximation operation has two major steps, firstly convert the information system from multiple valued one to single valued formal context, s...

The notion of continuity from above (upper continuity) for lattice-valued possibilistic measures as investigated in [7] has been proved to be a rather strong condition when imposed as demand on such a measure. Hence, our aim will be to introduce some versions of this upper continuity weakened in the sense that the conditions imposed in [7] to the whole definition domain of the possibilistic mea...

A multi-valued version of CTL∗ (mv-CTL∗), where both the propositions and the accessibility relation are multi-valued, taking values in a complete lattice with a complement, is considered. Contrary to all the existing model checking results for multi-valued modal logics, our lattices are not required to be finite. A set of restrictions is provided under which there is a direct translation from ...

Soft set theory, initiated by Molodtsov, can be used as a new mathematical tool for dealing with imprecise, vague, and uncertain problems. In this paper, the concepts of two types of generalised interval-valued fuzzy soft set are proposed and their basic properties are studied. The lattice structures of generalised interval-valued fuzzy soft set are also discussed. Furthermore, an application o...