The Inclusion-Exclusion Principle On the Set of IF-sets
نویسنده
چکیده
P. Grzegorzewski [3] has worked the probability version of the inclusion-exclusion principle and made a generalization for IF-events. He had applied two versions of the generalized formula, corresponding to different t-conorms and so defined the union of IF-events. This paper contains the generalization of the Grzegorzewski theorem. We prove it for mappings from the set of IF sets to the unit interval([2], [1]). Similar generalizations are presented in [4] and [5].
منابع مشابه
The Inclusion-Exclusion Principle for IF-States
Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events.In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski's inclusion-exclusion principle for probabilities on IF-events.Finally, we give some applications of this principle by...
متن کاملOn lattice of basic z-ideals
For an f-ring with bounded inversion property, we show that , the set of all basic z-ideals of , partially ordered by inclusion is a bounded distributive lattice. Also, whenever is a semiprimitive ring, , the set of all basic -ideals of , partially ordered by inclusion is a bounded distributive lattice. Next, for an f-ring with bounded inversion property, we prove that is a complemented...
متن کاملSymmetric Inclusion-Exclusion
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then the formulas A(S) = ∑ T⊆S B(T ) and B(S) = ∑ T⊆S(−1) |S|−|T A(T ) are equivalent. If we replace B(S) by (−1)B(S) then these formulas take on the symmetric form A(S) = ∑ T⊆S (−1) B(T ) B(S) = ∑ T⊆S (−1) A(T ). which we call symmetric inclusion-exclusion. We study instances of symmetric inclusi...
متن کاملLattice of full soft Lie algebra
In this paper, we study the relation between the soft sets and soft Lie algebras with the lattice theory. We introduce the concepts of the lattice of soft sets, full soft sets and soft Lie algebras and next, we verify some properties of them. We prove that the lattice of the soft sets on a fixed parameter set is isomorphic to the power set of a ...
متن کاملSYMMETRIC INCLUSION - EXCLUSION Ira
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then the formulas A(S) = ∑ T⊆S B(T ) and B(S) = ∑ T⊆S(−1) |A(T ) are equivalent. If we replace B(S) by (−1)|S|B(S) then these formulas take on the symmetric form A(S) = ∑
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011