Abstract

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 ) = ∫ W V ( a ) d μ ( V ) for some probability measure μ 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 Łukasiewicz logic with constants or with a product-like connective. We also extend de Finetti’s criterion to the noncommutative underlying logic of GMV-algebras.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.