Closure Semantics for Weak Modal Logics: Completeness and Representations

Abstract

Weak modal logics can be obtained by restricting the axioms and inference rules governing the modal operator. At the extreme, one may consider the least modal logic, in which no specifically modal axiom or inference rule is imposed. We introduce closure semantics, a new possible-world semantics for such weak modal logics, and establish soundness and strong completeness for a range of systems. We also give truth-preserving translations between closure models and other possible-world semantics, including neighborhood, FMT, and Kripke semantics.