Dynamic Probability Logic: Decidability & Computability
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911930670645248 |
|---|---|
| author | Chopoghloo, Somayeh Heidarpoor, Mahdi Pourmahdian, Massoud |
| author_facet | Chopoghloo, Somayeh Heidarpoor, Mahdi Pourmahdian, Massoud |
| contents | In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system $\mathcal{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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_16720 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Dynamic Probability Logic: Decidability & Computability Chopoghloo, Somayeh Heidarpoor, Mahdi Pourmahdian, Massoud Logic in Computer Science Logic In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system $\mathcal{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. |
| title | Dynamic Probability Logic: Decidability & Computability |
| topic | Logic in Computer Science Logic |
| url | https://arxiv.org/abs/2406.16720 |