Non-reversible betting games on fuzzy events: Complexity and algebra

A logical characterization of coherence for imprecise probabilities

“…In this section we define an interpretation of UMV-algebras into the class of tSMV-algebras, t being a suitable natural number depending on the terms to be interpreted. This interpretation will allow us to extend to UMV-algebras some complexity results from [8]. Definition 5.1.…”

“…It tells us that an axiom system is complete with respect to a given formal semantics. Hence there is no such thing as a 'the' completeness theorem, for logic, in general 8. A small terminological remark is in order.…”