Recursive windows for grammar logics of bounded density
Olivier Gasquet · arXiv (Cornell University) · 2025
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}.