Abstract
We introduce the logic of proofs whose modal counterpart is the modal logic S5. The language of Logic of Proofs LP is extended by a new unary operation of negative checker “?”. We define Kripke-style models for the resulting logic in the style of Fitting models and prove the corresponding Completeness theorem. The main result is the Realization theorem for the modal logic S5.
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
Artemov, S.: Uniform provability realization of intuitionistic logic, modality and λ-terms. Electronic Notes in Theoretical Computer Science, vol. 23 (1999)
Artemov, S.: Explicit provability and constructive semantics. Bulletine of Symbolic Logic 7, 1–36 (2001)
Artemov, S.: Evidence-based common knowledge. Technical Report TR-2004018 CUNY Ph.D. Program in Computer Science (2005)
Artemov, S., Kazakov, E., Shapiro, D.: On logic of knowledge with justifications. Technical Report CFIS 99-12, Cornell University (1999)
Fitting, M.: The logic of proofs, semantically. Annals of Pure and Applied Logic 132(1), 1–25 (2005)
Mkrtychev, A.: Models for the Logic of Proofs. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol. 1234, pp. 266–275. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rubtsova, N. (2006). Evidence Reconstruction of Epistemic Modal Logic S5 . In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_32
Download citation
DOI: https://doi.org/10.1007/11753728_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34166-6
Online ISBN: 978-3-540-34168-0
eBook Packages: Computer ScienceComputer Science (R0)