Complexity of some modal logics of density (extended version)
Abstract
By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in EXPTIME. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak density is in 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.