Skip to main content

Realizations and LP

  • Conference paper
Logical Foundations of Computer Science (LFCS 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4514))

Included in the following conference series:

Abstract

LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the Hintikka-style logic of knowledge S4, where they are not explicitly present. We provide tools for reasoning about justifications directly. Among other things, we provide machinery for combining two realizations of the same formula, and for replacing subformulas by equivalent subformulas. The results are algorithmic in nature—semantics for LP plays no role. We apply our results to provide a new algorithmic proof of Artemov’s Realization Theorem itself.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Artemov, S.: Explicit provability and constructive semantics. The Bulletin for Symbolic Logic 7(1), 1–36 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Gödel, K.: Eine Interpretation des intuitionistischen Aussagenkalküls. Ergebnisse eines mathematischen Kolloquiums 4, 39–40 (1933), English translation in: Feferman, S., Kleene, J.D., Moore, S.C., Solovay, G.H., van Heijenoort, R.M.J. (eds.): Kurt Gödel Collected Works, vol. 1. Oxford University Press, New York (1986)

    Google Scholar 

  3. Fitting, M.C.: The logic of proofs, semantically. Annals of Pure and Applied Logic 132, 1–25 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kuznets, R.: On self-referentiality in modal logic. The Bulletin of Symbolic Logic 12(3), 510 (2006)

    Google Scholar 

  5. Fitting, M.C.: A replacement theorem for LP. Technical report, CUNY Ph.D. Program in Computer Science (2006), http://www.cs.gc.cuny.edu/tr/

  6. Rubtsova, N.: Evidence reconstruction of epistemic modal logic S5. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 313–321. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Feferman, S., Kleene, J.D., Moore, S.C., Solovay, G.H., van Heijenoort, R.M.J. (eds.): Kurt Gödel Collected Works, vol. 1. Oxford University Press, New York (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Sergei N. Artemov Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Fitting, M. (2007). Realizations and LP . In: Artemov, S.N., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2007. Lecture Notes in Computer Science, vol 4514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72734-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72734-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72732-3

  • Online ISBN: 978-3-540-72734-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics