Recursive windows for grammar logics of bounded density
Logic in Computer Science
2025-08-11 v3
Abstract
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}.
Keywords
Cite
@article{arxiv.2507.14956,
title = {Recursive windows for grammar logics of bounded density},
author = {Olivier Gasquet},
journal= {arXiv preprint arXiv:2507.14956},
year = {2025}
}
Comments
This paper is still under construction, next versions will be uploaded