A Note on Relativised Products of Modal Logics (2003)
Cached
Download Links
- [www.dcs.kcl.ac.uk]
- [SunSITE.Informatik.RWTH-Aachen.de]
- DBLP
Other Repositories/Bibliography
| Venue: | Advances in Modal Logic |
| Citations: | 6 - 4 self |
BibTeX
@INPROCEEDINGS{Kurucz03anote,
author = {Agi Kurucz and Michael Zakharyaschev},
title = {A Note on Relativised Products of Modal Logics},
booktitle = {Advances in Modal Logic},
year = {2003},
pages = {221--242},
publisher = {King’s College Publications}
}
OpenURL
Abstract
this paper. each frame of the class.) For example, K is the logic of all n-ary product frames. It is not hard to see that S5 is the logic of all n-ary products of universal frames having the same worlds, that is, frames hU; R i i with R i = U U . We refer to product frames of this kind as cubic universal product S5 -frames. Note that the `i-reduct' F U 1 U n ; R i of F 1 F n is a union of n disjoint copies of F i . Thus, F and F i validate the same formulas, and so L n L 1 L n : There is a strong interaction between the modal operators of product logics. Every n-ary product frame satis es the following two properties, for each pair i 6= j, i; j = 1; : : : ; n: Commutativity : 8x8y8z xR i y ^ yR j z ! 9u (xR j u ^ uR i z) ^ xR j y ^ yR i z ! 9u (xR i u ^ uR j z) Church{Rosser property : 8x8y8z xR i y ^ xR j z ! 9u (yR j u ^ zR i u) This means that the corresponding modal interaction formulas 2 i 2 j p $ 2 j 2 i p and 3 i 2 j p ! 2 j 3 i p belong to every n-dimensional product logic. The geometrically intuitive many-dimensional structure of product frames makes them a perfect tool for constructing formalisms suitable for, say, spatio-temporal representation and reasoning (see e.g. [33, 34]) or reasoning about the behaviour of multi-agent systems (see e.g. [4]). However, the price we have to pay for the use of products is an extremely high computational complexity|even the product of two NP-complete logics can be non-recursively enumerable (see e.g. [29, 27]). In higher dimensions practically all products of `standard' modal logics are undecidable and non- nitely axiomatisable [16]







