Realization Theorems for Justification Logics: Full Modularity

Justification logics were introduced by Artemov ini¾ź1995 to provide intuitionistic logic with a classical provability semantics, a problem originally posed by Godel. Justification logics are refinements of modal logics and formally connected to them by so-called realization theorems. A constructive proof of a realization theorem typically relies on a cut-free sequent-style proof system for the corresponding modal logic. A uniform realization theorem for all the modal logics of the so-called modal cube, i.e.,i¾źfor the extensions of the basic modal logici¾źK with any subset of the axiomsi¾źd, t, b, 4,i¾źandi¾ź5, has been proven using nested sequents. However, the proof was not modular in that some realization theorems required postprocessing in the form of translation on the justification logic side. This translation relied on additional restrictions on the language of the justification logic in question, thus, narrowing the scope of realization theorems. We present a fully modular proof of the realization theorems for the modal cube that is based on modular nested sequents introduced by Marin and Straβburger.