Recursive windows for grammar logics of bounded density
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913979668889600 |
|---|---|
| author | Gasquet, Olivier |
| author_facet | Gasquet, Olivier |
| contents | We introduce the family of multi-modal logics of bounded density and with a tableau-like approach using finite \emph{windows} which were introduced in \cite{BalGasq25} and that we generalize to recursive windows. We prove that their satisfiability problem is {\bfseries PSPACE}-complete. As a side effect, the monomodal logic of density is shown to be in para-{\bfseries PSPACE}. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_14956 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Recursive windows for grammar logics of bounded density Gasquet, Olivier Logic in Computer Science 03B45, 68Q17 F.4.1; F.4.3 We introduce the family of multi-modal logics of bounded density and with a tableau-like approach using finite \emph{windows} which were introduced in \cite{BalGasq25} and that we generalize to recursive windows. We prove that their satisfiability problem is {\bfseries PSPACE}-complete. As a side effect, the monomodal logic of density is shown to be in para-{\bfseries PSPACE}. |
| title | Recursive windows for grammar logics of bounded density |
| topic | Logic in Computer Science 03B45, 68Q17 F.4.1; F.4.3 |
| url | https://arxiv.org/abs/2507.14956 |