The lattice Lu of upper semicontinuous convex normal functions with convolution ordering arises in studies of type-2 fuzzy sets. In 2002, Kawaguchi and Miyakoshi [Extended t-norms as logical connectives of fuzzy truth values, Multiple-Valued Logic 8(1) (2002) 53–69] showed that this lattice is a complete Heyting algebra. Later, Harding et al. [Lattices of convex, normal functions, Fuzzy Sets an...

In this paper we extend the notion of  degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and  introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...

We redefine a fuzzy congruence, discuss some properties of the fuzzy congruences, find the fuzzy congruence generated by a fuzzy relation on a semigroup, and give some lattice theoretic properties of the fuzzy congruences on semigroups.

In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...

Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68–92] have proved fundamental results that provide different equivalentways to represent fuzzy languageswithmembership values in a lattice-orderedmonoid, and generalize the well-known results of the classical theory of fo...

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes their semantic entailment and provability in graded setting which allows to draw partially true conclusions from partially true assumptions. We follow the Pa...

In this paper, based on Hájek, Vychodil, Rachunek and Šalounová’s works, we study the concept of v-filters of residuated lattices with weak vt-operators, axiomatize very true operators, discuss filters and v-filters of residuated lattices with weak vt-operator, give the formulas for calculating the v-filters generated by subsets, and show that lattice of v-filters of a commutative residuated la...

Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...

This paper proposes the FOGA (Fuzzy Ontology Generation frAmework) for automatic generation of fuzzy ontology on uncertainty information. The FOGA framework comprises the following components: Fuzzy Formal Concept Analysis, Fuzzy Conceptual Clustering and Fuzzy Ontology Generation. First, Fuzzy Formal Concept Analysis incorporates fuzzy logic into Formal Concept Analysis (FCA) to form a fuzzy c...

Computational Intelligence (CI) consists of an evolving collection of methodologies often inspired from nature (Bonissone, Chen, Goebel & Khedkar, 1999, Fogel, 1999, Pedrycz, 1998). Two popular methodologies of CI include neural networks and fuzzy systems. Lately, a unification was proposed in CI, at a “data level”, based on lattice theory (Kaburlasos, 2006). More specifically, it was shown tha...