Abstract

We present two complex valued probabilistic logics, LCOMPB and LCOMPS, which extend classical propositional logic. In LCOMPB one can express formulas of the form Bz,?? meaning that the probability of ? is in the complex ball with the center z and the radius ?, while in LCOMPS one can make statements of the form Sz,?? with the intended meaning - the probability of propositional formula ? is in the complex square with the center z and the side 2?. The corresponding strongly complete axiom systems are provided. Decidability of the logics are proved by reducing the satisfiability problem for LCOMPB (LCOMPS) to the problem of solving systems of quadratic (linear) inequalities.

Full Text
Paper version not known

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.