Finitely additive probability measures on classical propositional formulas definable by Gödel's t-norm and product t-norm

  • Authors:

  • Aleksandar Perović;Zoran Ognjanović;Miodrag Rašković;Dragan Radojević

  • Affiliations:

  • University of Belgrade, Faculty of Transportation and Traffic Engineering, Vojvode Stepe 305, 11000 Belgrade, Serbia;Mathematical Institute of Serbian Academy of Sciences and Arts, Kneza Mihaila 36, 11000 Belgrade, Serbia;Mathematical Institute of Serbian Academy of Sciences and Arts, Kneza Mihaila 36, 11000 Belgrade, Serbia;Mihailo Pupin Institute, Volgina 15, 11000 Belgrade, Serbia

  • Venue:
  • Fuzzy Sets and Systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.20

Visualization

Abstract

Suppose that e is any [0,1]-valued evaluation of the set of propositional letters. Then, e can be uniquely extended to finitely additive probability product and Godel's measures on the set of classical propositional formulas. Those measures satisfy that the measure of any conjunction of distinct propositional letters is equal to the product of, or to the minimum of the measures of the propositional letters, respectively. Product measures correspond to the one extreme - stochastic or probability independence of elementary events (propositional letters), while Godel's measures correspond to the other extreme - logical dependence of elementary events. Any linear convex combination of a product measure and a Godel's measure is also a finitely additive probability measure. In that way infinitely many intermediate measures that corresponds to various degrees of dependence of propositional letters can be generated. Such measures give certain truth-functional flavor to probability, enabling applications to preferential problems, in particular classifications according to predefined criteria. Some examples are provided to illustrate this possibility. We present the proof-theoretical and the model-theoretical approaches to a probabilistic logic which allows reasoning about the mentioned types of probabilistic functions. The logical language enables formalization of classification problems with the corresponding criteria expressible as propositional formulas. However, more complex criteria, for example involving arithmetical functions, cannot be represented in that framework. We analyze the well-known problem proposed by Grabisch to illustrate interpretation of such classification problems in fuzzy logic.