A first-order conditional probability logic with iterations | Zendy

Miloš Milošević | Zendy; Zoran Ognjanović | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A first-order conditional probability logic with iterations

Author(s) -

Miloš Milošević,

Zoran Ognjanović

Publication year - 2013

Publication title -

publications de l institut mathematique

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.246

H-Index - 17

eISSN - 1820-7405

pISSN - 0350-1302

DOI - 10.2298/pim1307019m

Subject(s) - gödel's completeness theorem , axiom , conditional probability , completeness (order theory) , second order logic , syntax , mathematics , computer science , higher order logic , discrete mathematics , calculus (dental) , theoretical computer science , artificial intelligence , description logic , statistics , mathematical analysis , geometry , medicine , dentistry

We investigate a first-order conditional probability logic with equality, which is, up to our knowledge, the first treatise of such logic. The logic, denoted LFPOIC=, allows making statements such as: CP≥s(Φ, θ), and CP≤s(Φ, θ), with the intended meaning that the conditional probability of Φ given θ is at least (at most) s. The corresponding syntax, semantic, and axiomatic system are introduced, and Extended completeness theorem is proven. [Projekat Ministarstva nauke Republike Srbije, br. III44006 i br. ON174026]

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research