Dynamic Probability Logic: Decidability & Computability

2024/06/24 by Chopoghloo, Somayeh, Heidarpoor, Mahdi, Pourmahdian, Massoud
#FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2406.16720

Abstract

In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system H_DPL is introduced for DPL and shown that it is weakly complete. Furthermore, this logic has the finite model property and so is decidable. Secondly, a strongly complete proof system HDPL is presented for DPL and proved that its canonical model is a computable structure.

Related

• Dynamic Probability Logics: Axiomatization & Definability
• Towards a Proof System for Probabilistic Dynamic Logic
• Probability Logic: A Model Theoretic Perspective
• Extending and Automating Basic Probability Theory with Propositional Computability Logic
• Metric Structures and Probabilistic Computation