Skip to main content

Boolean Logics with Relations

  • Conference paper
Relations and Kleene Algebra in Computer Science (RelMiCS 2008)

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

Included in the following conference series:

  • 413 Accesses

Abstract

We study a fragment of propositional modal logics using the universal modality given by a restriction on the modal depth of modal formulas.

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. Balbiani, P., Tinchev, T., Vakarelov, D.: Dynamic logics of the region-based theory of discrete spaces. Journal of Applied Non-Classical Logics 17 (2007)

    Google Scholar 

  2. Balbiani, P., Tinchev, T., Vakarelov, D.: Modal logics for region-based theories of space. Fundamenta Informaticæ 81 (2007)

    Google Scholar 

  3. Chagrov, A., Rybakov, M.: How many variables does one need to prove PSPACE-hardness of modal logics? In: Balbiani, P., Suzuki, N.-Y., Wolter, F., Zakharyaschev, M. (eds.) Advances in Modal Logic, vol. 4, King’s College (2003)

    Google Scholar 

  4. Chang, C., Keisler, H.: Model Theory. Elsevier, Amsterdam (1990)

    MATH  Google Scholar 

  5. Dimov, G., Vakarelov, D.: Contact algebras and region-based theory of space: a proximity approach – I. Fundamenta Informaticæ 74 (2006)

    Google Scholar 

  6. Dimov, G., Vakarelov, D.: Contact algebras and region-based theory of space: proximity approach – II. Fundamenta Informaticæ 74 (2006)

    Google Scholar 

  7. Düntsch, I., Winter, M.: A representation theorem for Boolean contact algebras. Theoretical Computer Science 347 (2005)

    Google Scholar 

  8. Halpern, J.: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence 75 (1995)

    Google Scholar 

  9. Kleene, S.: Introduction to Metamathematics. North-Holland, Amsterdam (1971)

    Google Scholar 

  10. Naimpally, S., Warrack, B.: Proximity Spaces. Cambridge University Press, Cambridge (1970)

    MATH  Google Scholar 

  11. Nguyen, L.: On the complexity of fragments of modal logics. In: Schmidt, R., Pratt-Hartmann, I., Reynolds, M., Wansing, H. (eds.) Advances in Modal Logic, vol. 5, King’s College (2005)

    Google Scholar 

  12. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  13. Stell, J.: Boolean connection algebras: a new approach to the region connection calculus. Artificial Intelligence 122 (2000)

    Google Scholar 

  14. Vakarelov, D., Dimov, G., Düntsch, I., Bennett, B.: A proximity approach to some region-based theory of space. Journal of Applied Non-Classical Logics 12 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rudolf Berghammer Bernhard Möller Georg Struth

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balbiani, P., Tinchev, T. (2008). Boolean Logics with Relations. In: Berghammer, R., Möller, B., Struth, G. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2008. Lecture Notes in Computer Science, vol 4988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78913-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78913-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics