Models for Many-Valued Probabilistic Reasoning
Tommaso Flaminio, F. Montagna · Journal of Logic and Computation · 2009
In this article, we compare models for many-valued probabilistic reasoning from the point of view of the sets of satisfiable formulas, positive satisfiable formulas, and tautologies. The results arising from this comparison will be used in the final part of the present article to provide results about the computational complexity for the problem of deciding if a formula belongs to one of the previously discussed sets.