We provide an extension of the notion of chain-valued frame introduced by Pultr and Rodabaugh in [Category theoretic aspects of chain-valued frames: parts I and II, Fuzzy Sets and Systems 159 (2008) 501–528 and 529–558] by relaxing the assumption that L be a complete chain. As a result of this investigation we formulate the category L-Frm of L-frames under the weaker assumption that L is a comp...

in this paper we study a representation of a fuzzy subgroup $mu$ of a group $g$, as a product of indecomposable fuzzy subgroups called the components of $mu$.  this representation is unique up to the number of components and their isomorphic copies. in the crisp group theory, this is a well-known theorem attributed to remak, krull, and schmidt. we consider the lattice of fuzzy subgroups and som...

Applying the idea of soft set theory to lattice implication algebras, the novel concept of (implicative) filteristic soft lattice implication algebras which related to (implicative) filter(for short, (IF -)F -soft lattice implication algebras) are introduced. Basic properties of (IF -)F -soft lattice implication algebras are derived. Two kinds of fuzzy filters (i.e.(∈,∈ ∨qk)((∈,∈ ∨ qk))-fuzzy (...

We characterize a fuzzy lattice through a fuzzy partial order relation, define ideals and filters of fuzzy lattices, characterize an ideal of fuzzy lattice using its level set and its support and show that a subset of a fuzzy lattice is an ideal if and only if its support is an ideal. Similarly, we show the same for its level set. Lastly, we define some kinds of ideals and filters of fuzzy latt...

The paper presents generalizations of results on so-called Horn logic, well-known in universal algebra, to the setting of fuzzy logic. The theories we consider consist of formulas which are implications between identities (equations) with premises weighted by truth degrees. We adopt Pavelka style: theories are fuzzy sets of formulas and we consider degrees of provability of formulas from theori...

The concept of L-fuzzy lattice is presented by means of an L-fuzzy partially ordered set. An L-fuzzy partially ordered set A is an L-fuzzy lattice if and only if one of A[a], A([a]), and A(a) is a lattice.

This paper proposes to study the lattice properties of two closed binary operations in the set of discrete fuzzy numbers. Using these operations to represent the meet and the join, we prove that the set of discrete fuzzy numbers whose support is a set of consecutive natural numbers is a distributive lattice. Finally, we demonstrate that the subsets of discrete fuzzy numbers, which have the same...

One of the most important elements in a lattice are the irreducible elements. For example, when the lattice is finite, which is usual in the computational case, it forms a base from which the complete lattice is obtained. These elements are also important in Formal Concept Analysis, since they are the basic information of a relational system. In the general fuzzy framework of multi-adjoint conc...

In this paperwe adapt thewell-knownBrzozowskideterminizationmethod to fuzzy automata. Thismethod gives better results than all previously knownmethods for determinization of fuzzy automata developed by Bělohlávek [InformSciences 143 (2002)205–209],Li andPedrycz [FuzzySet Syst 156 (2005)68–92], Ignjatović et al. [Inform Sciences 178 (2008) 164–180], and Jančić et al. [Inform Sciences 181 (2011) ...

This work studies the L-fuzzy context sequences when L is a complete lattice extending the results obtained in previous works with L = [0, 1]. To do this, we will use n-ary OWA operators on complete lattices. With the aid of these operators, we will study the different contexts values of the sequence using some new relations. As a particular case, we have the study when L = J ([0, 1]). Finally,...