Complexity of the variable-free fragments of non-normal modal logics (extended version)
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918090418159616 |
|---|---|
| author | Kudinov, A. Rybakov, M. |
| author_facet | Kudinov, A. Rybakov, M. |
| contents | We show that the satisfiability problem for the variable-free fragment of every modal logic containing classical propositional logic and contained in the weak Grzegorczyk logic is NP-hard. In particular, the variable-free fragments of the non-normal modal logics E, EM, EN, and EMN are coNP-complete. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_09136 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Complexity of the variable-free fragments of non-normal modal logics (extended version) Kudinov, A. Rybakov, M. Logic We show that the satisfiability problem for the variable-free fragment of every modal logic containing classical propositional logic and contained in the weak Grzegorczyk logic is NP-hard. In particular, the variable-free fragments of the non-normal modal logics E, EM, EN, and EMN are coNP-complete. |
| title | Complexity of the variable-free fragments of non-normal modal logics (extended version) |
| topic | Logic |
| url | https://arxiv.org/abs/2507.09136 |