Skip to main content

Conservativity for Logics of Justified Belief

  • Conference paper
  • 473 Accesses

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

Abstract

In [1], Fitting showed that the standard hierarchy of logics of justified knowledge is conservative (e.g. a logic with positive introspection operator ! is conservative over the logic without !). We do the same with most logics of justified belief, but taking a semantic approach rather than Fitting’s syntactic one. A brief example shows that conservativity does not hold for logics of justified consistent belief.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fitting, M.: Explicit logics of knowledge and conservativity. In: Tenth International Symposium on Artificial Intelligence and Mathematics, ISAIM 2008, Fort Lauderdale, Florida, January 2–4, 2008, Online Proceedings (2008)

    Google Scholar 

  2. Artëmov, S.N.: Logic of proofs. Annals of Pure and Applied Logic 67(1–3), 29–59 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Artemov, S.N.: Explicit provability: the intended semantics for intuitionistic and modal logic. Technical Report CFIS 98–10, Cornell University (September 1998)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Gödel, K.: Eine interpretation des intuitionistischen aussagenkalküls. Ergebnisse Math. Colloq. 4, 39–40 (1933)

    MATH  Google Scholar 

  6. Brezhnev, V.N.: On the logic of proofs. In: Striegnitz, K. (ed.) Proceedings of the sixth ESSLLI Student Session, Helsinki, pp. 35–46 (August 2001)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Mkrtychev, A.: Models for the Logic of Proofs. In: Adian, S.I., Nerode, A. (eds.) LFCS 1997. LNCS, vol. 1234, pp. 266–275. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  9. Kuznets, R.: On the complexity of explicit modal logics. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 371–383. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Milnikel, R.S. (2008). Conservativity for Logics of Justified Belief. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92687-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-92687-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics