Complexity of some modal logics of density (extended version)
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908450477309952 |
|---|---|
| author | Balbiani, Philippe Gasquet, Olivier |
| author_facet | Balbiani, Philippe Gasquet, Olivier |
| contents | By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak density is in $PSPACE$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_11238 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Complexity of some modal logics of density (extended version) Balbiani, Philippe Gasquet, Olivier Logic in Computer Science 03B45 F.4.1 By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak density is in $PSPACE$. |
| title | Complexity of some modal logics of density (extended version) |
| topic | Logic in Computer Science 03B45 F.4.1 |
| url | https://arxiv.org/abs/2507.11238 |