نتایج جستجو برای: complete residuated lattices

تعداد نتایج: 381361  

Journal: :Int. J. Fuzzy Logic and Intelligent Systems 2012
Yong Chan Kim Jung Mi Ko

We introduce the notion of (L, e)-filters with fuzzy partially order e on complete residuated lattice L. We investigate (L, e)-filters induced by the family of (L, e)-filters and functions. In fact, we study the initial and final structures for the family of (L, e)-filters and functions. From this result, we define the product and co-product for the family of (L, e)-filters and functions.

2011
MANUELA BUSANICHE ROBERTO CIGNOLI

In the paper Busaniche and Cignoli (2009) we presented a quasivariety of commutative residuated lattices, called NPc-lattices, that serves as an algebraic semantics for paraconsistent Nelson’s logic. In the present paper we show that NPc-lattices form a subvariety of the variety of commutative residuated lattices, we study congruences of NPc-lattices and some subvarieties of NPc-lattices.

2009
Antonín Dvorák Michal Holcapek

The aim of this paper is to introduce two new types of fuzzy integrals, namely, ⊗-fuzzy integral and →-fuzzy integral, where ⊗ and → are the multiplication and residuum of a complete residuated lattice, respectively. The first integral is based on a fuzzy measure of L-fuzzy sets and the second one on a complementary fuzzy measure of L-fuzzy sets, where L is a complete residuated lattice. Some o...

Journal: :J. Exp. Theor. Artif. Intell. 2006
Radim Belohlávek Vilém Vychodil

We present a logic, called fuzzy attribute logic, for reasoning about formulas describing particular attribute dependencies. The formulas are of a form A ⇒ B where A and B are collections of attributes. Our formulas can be interpreted in two ways. First, in data tables with entries containing degrees to which objects (table rows) have attributes (table columns). Second, in database tables where...

D. Busneag D. Piciu

At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...

In this paper, we investigate more relations between the symmetric residuated lattices $L$ with their corresponding intuitionistic fuzzy residuated lattice $tilde{L}$. It is shown that some algebraic structures of $L$ such as Heyting algebra, Glivenko residuated lattice and strict residuated lattice are preserved for $tilde{L}$. Examples are given for those structures that do not remain the sam...

2005
Peter Jipsen

We consider various classes of algebras obtained by expanding idempotent semirings with meet, residuals and Kleene-∗. An investigation of congruence properties (epermutability, e-regularity, congruence distributivity) is followed by a section on algebraic Gentzen systems for proving inequalities in idempotent semirings, in residuated lattices, and in (residuated) Kleene lattices (with cut). Fin...

2002
Peter Jipsen

1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system for Residuated Kleene Lattices and some reducts 4. Interpreting Kleene algebras with tests 1. Residuated Lattices with iteration This talk is mostly about Residuated Kleene Lattices, which are defined as noncommutative residuated 0,1-lattices expanded with a unary operation * that satisfies x ...

Journal: :Inf. Sci. 2010
Bart Van Gasse Glad Deschrijver Chris Cornelis Etienne E. Kerre

An important concept in the theory of residuated lattices and other algebraic structures used for formal fuzzy logic, is that of a filter. Filters can be used, amongst others, to define congruence relations. Specific kinds of filters include Boolean filters and prime filters. In this paper, we define several different filters of residuated lattices and triangle algebras and examine their mutual...

Journal: :Reports on Mathematical Logic 2000
Tomasz Kowalski Hiroakira Ono

In this paper, we will show that the variety of residuated lattices is generated by finite simple residuated lattices. The “simplicity” part of the proof is based on Grǐsin’s idea from [5], whereas the “finiteness” part employs a kind of algebraic filtration argument. Since the set of formulas valid in all residuated lattices is equal to the set of formulas provable in the propositional logic F...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید