On modal logic of deductive closure

Abstract

A new modal logic $\mathcal{D}$ is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic $\mathcal{D}$ is proven to be decidable and complete with respect to this semantics.