Skip to main content

Expressive Power and Decidability for Memory Logics

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5110))

Abstract

Taking as inspiration the hybrid logic \(\mathcal{HL}({\downarrow})\), we introduce a new family of logics that we call memory logics. In this article we present in detail two interesting members of this family defining their formal syntax and semantics. We then introduce a proper notion of bisimulation and investigate their expressive power (in comparison with modal and hybrid logics). We will prove that in terms of expressive power, the memory logics we discuss in this paper are more expressive than orthodox modal logic, but less expressive than \(\mathcal{HL}({\downarrow})\). We also establish the undecidability of their satisfiability problems.

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   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   99.00
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. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  2. Blackburn, P., Seligman, J.: Hybrid languages. Journal of Logic, Language and Information 4, 251–272 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ebbinghaus, H., Flum, J., Thomas, W.: Mathematical Logic. Springer, Heidelberg (1984)

    MATH  Google Scholar 

  4. Areces, C., Blackburn, P., Marx, M.: Hybrid logics: characterization, interpolation and complexity. The Journal of Symbolic Logic 66(3), 977–1010 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Börger, E., Grädel, E., Gurevich, Y.: The classical decision problem. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  6. Blackburn, P.: Internalizing labelled deduction. Journal of Logic and Computation 10(1), 137–168 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. van Benthem, J.: An essay on sabotage and obstruction. In: Mechanizing Mathematical Reasoning, pp. 268–276 (2005)

    Google Scholar 

  8. Gerbrandy, J.: Bisimulations on Planet Kripke. PhD thesis, University of Amsterdam, ILLC Dissertation series DS-1999-01 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wilfrid Hodges Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Areces, C., Figueira, D., Figueira, S., Mera, S. (2008). Expressive Power and Decidability for Memory Logics. In: Hodges, W., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2008. Lecture Notes in Computer Science(), vol 5110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69937-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69937-8_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69936-1

  • Online ISBN: 978-3-540-69937-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics