Skip to main content
SpringerLink
Log in

Interacting Explicit Evidence Systems

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Logic of proofs \(\mathsf{LP}\) , introduced by S. Artemov, originally designed for describing properties of formal proofs, now became a basis for the theory of knowledge with justification (cf. S. Artemov, Evidence-based common knowledge, Technical report TR–2004018, CUNY Ph.D. Program in Computer Science, 2005). So far, in epistemic systems with justification the corresponding “evidence part”, even for multi-agent systems, consisted of a single explicit evidence logic. In this paper we introduce logics describing two interacting explicit evidence systems. We find an appropriate formalization of the intended semantics and prove the completeness of these logics with respect to both symbolic and arithmetical models. Also, we find the forgetful projections for the two-agent justification logics which are extensions of the bimodal logic \(\mathsf{S4}^{2}\) .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Artemov, S.: Uniform provability realization of intuitionistic logic, modality and λ-terms. Electron. Notes Theor. Comput. Sci. 23 (1999)

  2. Artemov, S.: Explicit provability and constructive semantics. Bull. Symb. Log. 7, 1–36 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Artemov, S.: Evidence–based common knowledge. Technical report TR–2004018, CUNY Ph.D. Program in Computer Science (2005)

  4. Avron, A.: On Modal Systems having arithmetical interpretation. J. Symb. Log. 49, 935–942 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  5. Fitting, M.: The logic of proofs, semantically. Ann. Pure Appl. Log. 132(1), 1–25 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kuznets, R.: On the complexity of explicit modal logics. In: Computer Science Logic 2000. Lecture Notes in Computer Science, vol. 1862, pp. 371–383. Springer, Berlin (2000)

    Chapter  Google Scholar 

  7. Mkrtychev, A.: Models for the logic of proofs. In: Logical Foundations of Computer Science ’97, Yaroslavl’. Lecture Notes in Computer Science, vol. 1234, pp. 266–275. Springer, Berlin (1997)

    Google Scholar 

  8. Smoryński, C.: Self-reference and Modal Logic. Springer, New York (1985)

    Google Scholar 

  9. Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press, Cambridge (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Logic and Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow, 119992, Russia

    Tatiana Yavorskaya (Sidon)

Authors
  1. Tatiana Yavorskaya (Sidon)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tatiana Yavorskaya (Sidon).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yavorskaya (Sidon), T. Interacting Explicit Evidence Systems. Theory Comput Syst 43, 272–293 (2008). https://doi.org/10.1007/s00224-007-9057-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-9057-y

Keywords

Search

Navigation