MV-algebras with internal states and probabilistic fuzzy logics
International Journal of Approximate Reasoning
Conditionals and Independence in Many-Valued Logics
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Open Partitions and Probability Assignments in Gödel Logic
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
The coherence of Łukasiewicz assessments is NP-complete
International Journal of Approximate Reasoning
On varieties of MV-algebras with internal states
International Journal of Approximate Reasoning
Measures, states and de Finetti maps on pseudo-BCK algebras
Fuzzy Sets and Systems
Subdirectly irreducible state-morphism BL-algebras
Archive for Mathematical Logic
Non-reversible betting games on fuzzy events: Complexity and algebra
Fuzzy Sets and Systems
A logical characterization of coherence for imprecise probabilities
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning
State operators on generalizations of fuzzy structures
Fuzzy Sets and Systems
States on commutative basic algebras
Fuzzy Sets and Systems
State-morphism algebras---General approach
Fuzzy Sets and Systems
Non-standard probability, coherence and conditional probability on many-valued events
International Journal of Approximate Reasoning
Hi-index | 0.00 |
In this paper de Finetti's (no-Dutch-Book) criterion for coherent probability assignments is extended to large classes of logics and their algebras. Given a set A of ''events'' and a closed set W@?[0,1]^A of ''possible worlds'' we show that a map s:A-[0,1] satisfies de Finetti's criterion if, and only if, it has the form s(a)=@!"WV(a)d@m(V) for some probability measure @m on W. Our results are applicable to all logics whose connectives are continuous operations on [0,1], notably (i) every [0,1]-valued logic with finitely many truth-values, (ii) every logic whose conjunction is a continuous t-norm, and whose negation is @?x=1-x, possibly also equipped with its t-conorm and with some continuous implication, (iii) any extension of Lukasiewicz logic with constants or with a product-like connective. We also extend de Finetti's criterion to the noncommutative underlying logic of GMV-algebras.