All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

De Finetti theorem and Borel states in [0,1]-valued algebraic logic

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F07%3A00004737" target="_blank" >RIV/61989592:15310/07:00004737 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    De Finetti theorem and Borel states in [0,1]-valued algebraic logic

  • Original language description

    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 $Wsubseteq [0,1]^A$ of ?possible worlds? we show that a map $s: A to [0,1]$ satisfies de Finetti?s criterion if and only if it has the form $s(a) = int_W V(a) dmu(V)$ for some probability measure $?$ on $W$. Our results are applicable to all logics whose connectives are continuous operations on $[0,1]$. We also extend de Finetti?s criterion to the noncommutative underlying logic of GMV-algebras.

  • Czech name

    De Finettiho věta a Borelovy stavy v [0,1]-hodnotové algebraické logice

  • Czech description

    De Finettiho (no-Dutch-Book) kriterium pro koherentní pravděpodobnost je rozšířeno pro široké třídy logik a jejich algeber. Pro danou množinu $A$ "událostí" a uzavřenou množinu $Wsubseteq [0,1]^A$ "možných světů" ukážeme, že zobrazení $s: A to [0, 1]$splňuje de Finettiho kriterium, právě když má tvar $s(a) = int_W V(a)dmu(V)$ pro některou pravděpodobnostní míru $mu$ na $W$. Výsledky jsou aplikovatelné v případě logik jejichž spojky jsou spojité na $[0,1]$. Dále rozříříme de Finettiho kriterium pronekomutativní logiku GMV-algeber.

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2007

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    International Journal of Approximate Reasoning

  • ISSN

    0888-613X

  • e-ISSN

  • Volume of the periodical

    46

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    12

  • Pages from-to

    605-616

  • UT code for WoS article

  • EID of the result in the Scopus database