In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system HDPL 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.
No takes yet. Share an insight, caveat, or question.
Chopoghloo et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: