Radosav S. Dordevic

  • Citations Per Year
Learn More
A propositional logic is defined which in addition to propositional language contains a list of probabilistic operators of the formP≥s (with the intended meaning “the probability is at least s”). The axioms and rules syntactically determine that ranges of probabilities in the corresponding models are always finite. The completeness theorem is proved. It is(More)
  • 1