Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arisaka, R., Das, A., Straßburger, L.: On nested sequents for constructive modal logics. E-print 1505.06896, arXiv, May 2015
Artemov, S.N.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1), 1–36 (2001)
Artemov, S.N., Fitting, M.: Justification logic. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Fall 2012 edn. (2012), http://plato.stanford.edu/archives/fall2012/entries/logic-justification/
Artemov, S.N., Kazakov, E.L., Shapiro, D.: Logic of knowledge with justifications. Tech. Rep. CFIS 99–12, Cornell University (1999)
Brezhnev, V.N.: On explicit counterparts of modal logics. Tech. Rep. CFIS 2000–05, Cornell University (2000)
Brezhnev, V.N., Kuznets, R.: Making knowledge explicit: How hard it is. Theoretical Computer Science 357(1–3), 23–34 (2006)
Brünnler, K.: Deep sequent systems for modal logic. Archive for Mathematical Logic 48(6), 551–577 (2009)
Bucheli, S., Kuznets, R., Studer, T.: Realizing public announcements by justifications. Journal of Computer and System Sciences 80(6), 1046–1066 (2014)
Fitting, M.: The logic of proofs, semantically. Annals of Pure and Applied Logic 132(1), 1–25 (2005)
Fitting, M.: Realizations and LP. Annals of Pure and Applied Logic 161(3), 368–387 (2009)
Fitting, M.: Realization using the model existence theorem. Journal of Logic and Computation Advance Access, July 2013, http://dx.doi.org/10.1093/logcom/ext025
Fitting, M.: Nested sequents for intuitionistic logics. Notre Dame Journal of Formal Logic 55(1), 41–61 (2014)
Fitting, M., Kuznets, R.: Modal interpolation via nested sequents. Annals of Pure and Applied Logic 166(3), 274–305 (2015)
Fitting, M., Mendelsohn, R.L.: First-Order Modal Logic, Synthese Library, vol. 277. Kluwer Academic Publishers (1998)
Garson, J.: Modal logic. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Summer 2014 edn. (2014), http://plato.stanford.edu/archives/sum2014/entries/logic-modal/
Goetschi, R., Kuznets, R.: Realization for justification logics via nested sequents: Modularity through embedding. Annals of Pure and Applied Logic 163(9), 1271–1298 (2012)
Hakli, R., Negri, S.: Does the deduction theorem fail for modal logic? Synthese 187(3), 849–867 (2012)
Kuznets, R.: Self-referential justifications in epistemic logic. Theory of Computing Systems 46(4), 636–661 (2010)
Marin, S., Straßburger, L.: Label-free modular systems for classical and intuitionistic modal logics. In: Advances in Modal Logic, vol. 10, pp. 387–406. College Publications (2014)
Mints, G.E.: Lewis’ systems and system T (1965–1973). In: Selected Papers in Proof Theory, Studies in Proof Theory, vol. 3, pp. 221–294. Bibliopolis and North-Holland (1992)
Rubtsova, N.M.: On realization of S5-modality by evidence terms. Journal of Logic and Computation 16(5), 671–684 (2006)
Yu, J.: Self-referentiality of Brouwer–Heyting–Kolmogorov semantics. Annals of Pure and Applied Logic 165(1), 371–388 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Borg, A., Kuznets, R. (2015). Realization Theorems for Justification Logics: Full Modularity. In: De Nivelle, H. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2015. Lecture Notes in Computer Science(), vol 9323. Springer, Cham. https://doi.org/10.1007/978-3-319-24312-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-24312-2_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24311-5
Online ISBN: 978-3-319-24312-2
eBook Packages: Computer ScienceComputer Science (R0)