Dynamic Probability Logic: Decidability & Computability
Logic in Computer Science
2024-06-25 v1 Logic
Abstract
In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system 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.
Keywords
Cite
@article{arxiv.2406.16720,
title = {Dynamic Probability Logic: Decidability & Computability},
author = {Somayeh Chopoghloo and Mahdi Heidarpoor and Massoud Pourmahdian},
journal= {arXiv preprint arXiv:2406.16720},
year = {2024}
}
Comments
arXiv admin note: text overlap with arXiv:2401.07235