Recursive windows for grammar logics of bounded density
Abstract
We introduce the family of multi-modal logics of bounded density and with a tableau-like approach using finite windows which were introduced in BalGasq25 and that we generalize to recursive windows. We prove that their satisfiability problem is PSPACE-complete. As a side effect, the monomodal logic of density is shown to be in para- PSPACE.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.