AbstractWe extend De Finetti’s coherence criterion to the infinite-valued propositional logic of Łukasiewicz. Given a finite set of formulas ψi and corresponding real numbers βi∈[0,1], we prove that the βi’s arise from a finitely additive measure on formulas if, and only if, there is no possible choice of “stakes” σi∈R such that, for every valuation V the quantity ∑i=1nσi(βi-V(ψi)) is <0. This solves a problem of Jeff Paris, and generalizes previous work on Dutch Books in finite-valued logics, by B. Gerla and others. We also extend our result to infinitely many formulas, and to the case when the formulas ψi are logically related. In a final section we deal with the problem of deciding if a book is Dutch
AbstractLet ϕ be a formula of Łukasiewicz infinite-valued propositional logic having a total of l ma...
AbstractWe investigate the infinitary logic L∞ωω, in which sentences may have arbitrary disjunctions...
Although it is well-known that every satisfiable formula in Łukasiewicz’ infinite-valued logic L∞ ca...
AbstractWe extend De Finetti’s coherence criterion to the infinite-valued propositional logic of Łuk...
We extend de Finettis No-Dutch-Book Criterion to Gödel infinite-valued propositional logic
In general, every logic L comes equipped with a syntax, a semantics, and an algorithmic procedure. I...
In this paper we deepen Mundici's analysis on reducibility of the decision problem from infinite-val...
In this paper we present a method to reduce the decision problem of several infinite-valued proposit...
In this paper we present a method to reduce the decision problem of several infinite-valued proposit...
AbstractIn this paper de Finetti’s (no-Dutch-Book) criterion for coherent probability assignments is...
In his foundation of probability theory, Bruno de Finetti devised a betting scheme where a bookmaker...
AbstractThe problem of deciding whether a rational assessment of formulas of infinite-valued Łukasie...
Let phi be a formula of Łukasiewicz infinite-valued propositional logic having a total of l many occ...
Although it is well-known that every satisfiable formula in Lukasiewicz' infinite-valued logic L-inf...
The problem of deciding whether a rational assessment of formulas of infinite-valued Łukasiewicz log...
AbstractLet ϕ be a formula of Łukasiewicz infinite-valued propositional logic having a total of l ma...
AbstractWe investigate the infinitary logic L∞ωω, in which sentences may have arbitrary disjunctions...
Although it is well-known that every satisfiable formula in Łukasiewicz’ infinite-valued logic L∞ ca...
AbstractWe extend De Finetti’s coherence criterion to the infinite-valued propositional logic of Łuk...
We extend de Finettis No-Dutch-Book Criterion to Gödel infinite-valued propositional logic
In general, every logic L comes equipped with a syntax, a semantics, and an algorithmic procedure. I...
In this paper we deepen Mundici's analysis on reducibility of the decision problem from infinite-val...
In this paper we present a method to reduce the decision problem of several infinite-valued proposit...
In this paper we present a method to reduce the decision problem of several infinite-valued proposit...
AbstractIn this paper de Finetti’s (no-Dutch-Book) criterion for coherent probability assignments is...
In his foundation of probability theory, Bruno de Finetti devised a betting scheme where a bookmaker...
AbstractThe problem of deciding whether a rational assessment of formulas of infinite-valued Łukasie...
Let phi be a formula of Łukasiewicz infinite-valued propositional logic having a total of l many occ...
Although it is well-known that every satisfiable formula in Lukasiewicz' infinite-valued logic L-inf...
The problem of deciding whether a rational assessment of formulas of infinite-valued Łukasiewicz log...
AbstractLet ϕ be a formula of Łukasiewicz infinite-valued propositional logic having a total of l ma...
AbstractWe investigate the infinitary logic L∞ωω, in which sentences may have arbitrary disjunctions...
Although it is well-known that every satisfiable formula in Łukasiewicz’ infinite-valued logic L∞ ca...