Talks and Poster Presentations (with Proceedings-Entry):
A. Borg, R. Kuznets:
"Realization Theorems for Justification Logics: Full Modularity";
Talk: 24th International Conference, TABLEAUX 2015,
- 2015-09-24; in: "Automated Reasoning with Analytic Tableaux and Related Methods, 24th International Conference, TABLEAUX 2015, Wrosław, Poland, September 21-24, 2015, Proceedings",
H. De Nivelle (ed.);
Justification logics were introduced by Artemov in 1995 to provide intuitionistic logic with a classical provability semantics, a problem originally posed by Gödel. 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., for the extensions of the basic modal logic K with any subset of the axioms d, t, b, 4, and 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.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.