Axiomatizing Distance Logics

In [STU 00, KUT 03] we introduced a family of ‘modal' languages intended for talking about distances. These languages are interpreted in ‘distance spaces' which satisfy some (or all) of the standard axioms of metric spaces. Among other things, we singled out decidable logics of distance spaces and proved expressive completeness results relating classical and modal languages. The aim of this paper is to axiomatize the modal fragments of the semantically defined distance logics of [KUT 03] and give a new proof of their decidability.

[1]  Valentin Goranko,et al.  Using the Universal Modality: Gains and Questions , 1992, J. Log. Comput..

[2]  Frank Wolter,et al.  Spatio-temporal representation and reasoning based on RCC-8 , 2000, International Conference on Principles of Knowledge Representation and Reasoning.

[3]  Frank Wolter,et al.  Logics of metric spaces , 2003, TOCL.

[4]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[5]  Tinko Tinchev,et al.  Modal Environment for Boolean Speculations , 1987 .

[6]  Frank Wolter,et al.  Connecting Abstract Description Systems , 2002 .

[7]  Michael Zakharyaschev,et al.  Modal Logic , 1997, Oxford logic guides.

[8]  V. Goranko.  Completeness and Incompleteness in the Bimodal Base ℒ(R,−R) , 1990 .

[9]  M. de Rijke,et al.  The Modal Logic of Inequality , 1992, J. Symb. Log..

[10]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.