Complexity of some modal logics of density (extended version)
Logic in Computer Science
2025-07-16 v1
Abstract
By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in . By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak density is in .
Cite
@article{arxiv.2507.11238,
title = {Complexity of some modal logics of density (extended version)},
author = {Philippe Balbiani and Olivier Gasquet},
journal= {arXiv preprint arXiv:2507.11238},
year = {2025}
}