Studia Logica

, Volume 85, Issue 1, pp 75–104

Notes on Logics of Metric Spaces

Article

Abstract

In [14], we studied the computational behaviour of various first-order and modal languages interpreted in metric or weaker distance spaces. [13] gave an axiomatisation of an expressive and decidable metric logic. The main result of this paper is in showing that the technique of representing metric spaces by means of Kripke frames can be extended to cover the modal (hybrid) language that is expressively complete over metric spaces for the (undecidable) two-variable fragment of first-order logic with binary pred-icates interpreting the metric. The frame conditions needed correspond rather directly with a Boolean modal logic that is, again, of the same expressivity as the two-variable fragment. We use this representation to derive an axiomatisation of the modal hybrid variant of the two-variable fragment, discuss the compactness property in distance logics, and derive some results on (the failure of) interpolation in distance logics of various expressive power.

Keywords

Metric spaces expressive completeness Boolean modal logic hybrid logic axiomatisation interpolation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Areces, C., and M. Marx, ‘Failure of Interpolation in Combined Modal Logics’, Notre Dame Journal of Formal Logic, 39(2):253–273, 1998.CrossRefGoogle Scholar
  2. [2]
    Blackburn, P., and M. Tzakova, ‘Hybrid languages and temporal logic’, Logic Journal of the IGPL, 7(1):27–54, 1999.CrossRefGoogle Scholar
  3. [3]
    Bull, R., ‘An approach to tense logic’, Theoria, 36(3):282–300, 1970.CrossRefGoogle Scholar
  4. [4]
    ten Cate, B., ‘Interpolation for extended modal languages’, The Journal of Symbolic Logic, 70(1):223–234, 2005.CrossRefGoogle Scholar
  5. [5]
    Etessami, K., M. Vardi, and T. Wilke, ‘First-order logic with two variables and unary temporal logic’, Proceedings of 12th. IEEE Symp. Logic in Computer Science, 1997, pp. 228–235.Google Scholar
  6. [6]
    Fine, K., ‘An ascending chain of S4 logics’, Theoria, 40:110–116, 1974.CrossRefGoogle Scholar
  7. [7]
    Gargov, G., and V. Goranko, ‘Modal Logic with Names’, Journal of Philosophical Logic, 22(6):607–636, 1993.CrossRefGoogle Scholar
  8. [8]
    G. Gargov, S. Passy, and T. Tinchev, ‘Modal environment for Boolean specula- tions’, in D. Skordev, editor, Mathematical Logic and its Applications. Proceedings of the Summer School and Conference dedicated to the 80th Anniversary of Kurt Gödel, Druzhba, 1986. Plenum Press, New York, 1987, pp. 253–263.Google Scholar
  9. [9]
    Goldblatt, R., Axiomatizing the Logic of Computer Programming, volume 130 of Lecture Notes in Computer Science, Springer, 1982.Google Scholar
  10. [10]
    Goranko, V., ‘Axiomatizations with Context Rules of Inference in Modal Logic’, Studia Logica, 61:179–197, 1998.CrossRefGoogle Scholar
  11. [11]
    Goranko, V., and D. Vakarelov, ‘Sahlqvist Formulas in Hybrid Polyadic Modal Logics’, C. Areces and P. Blackburn (eds.), Special Issue on Hybrid Logics. Journal of Logic and Computation, 11(5):737–754, 2001.CrossRefGoogle Scholar
  12. [12]
    Kutz, O., E-Connections and Logics of Distance, PhD thesis, The University of Liverpool, 2004.Google Scholar
  13. [13]
    Kutz, O., H. Sturm, N.-Y. Suzuki, F. Wolter, and M. Zakharyaschev, ‘Ax- iomatizing distance logics’, Journal of Applied Non-Classical Logic, 12:425–440, 2002.Google Scholar
  14. [14]
    Kutz, O., H. Sturm, N.-Y. Suzuki, F. Wolter, and M. Zakharyaschev, ‘Logics of metric spaces’, ACM Transactions on Computational Logic, 4(2):260–294, 2003.CrossRefGoogle Scholar
  15. [15]
    Lutz, C., and U. Sattler, ‘The Complexity of Reasoning with Boolean Modal Logic’, in F. Wolter, H. Wansing, M. de Rijke, and M. Zakharyaschev (eds.), Advances in Modal Logic, volume 3. World Scientific Publishing Company, 2002, pp. 329–348.Google Scholar
  16. [16]
    Lutz, C., U. Sattler, and F. Wolter, ‘Modal logics and the two-variable frag- ment’, Annual Conference of the European Association for Computer Science Logic CSL'01, LNCS, Springer Verlag, Paris, France, 2001.Google Scholar
  17. [17]
    Marx, M., and Y. Venema, Multi-dimensional modal logic, Kluwer Academic Publishers, Dordrecht, 1997.Google Scholar
  18. [18]
    Passy, S., and T. Tinchev, ‘An essay in combinatory dynamic logic’, Information and Computation, 93(2), 1991.Google Scholar
  19. [19]
    de Rijke, M., ‘The modal logic of inequality’, The Journal of Symbolic Logic, 57(2):566–584, 1992.CrossRefGoogle Scholar
  20. [20]
    Venema, Y., ‘Derivation Rules as Anti-Axioms in Modal Logic’, The Journal of Symbolic Logic, 58(3):1003–1034, 1993.CrossRefGoogle Scholar
  21. [21]
    Wolter, F., and M. Zakharyaschev, ‘Reasoning about distances’, Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, Mexico, 2003, pp. 1275–1280.Google Scholar
  22. [22]
    Wolter, F., and M. Zakharyaschev, ‘A logic for metric and topology’, The Journal of Symbolic Logic, 70(3):795–828, 2005.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2007

Authors and Affiliations

  1. 1.School of Computer ScienceThe University of ManchesterManchesterUK

Personalised recommendations