Journal of Symbolic Logic

Products of ‘transitive’ modal logics

David Gabelaia, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics as K4, S4, S4.1, K4.3, GL, or Grz are undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4,K4] with product frames of arbitrary finite or infinite depth (with respect to both accessibility relations) can be decidable. In particular, if 𝒞₁ and 𝒞₂ are classes of transitive frames such that their depth cannot be bounded by any fixed n <ω, then the logic of the class { 𝔉₁ × 𝔉₂ | 𝔉₁ ∈ 𝒞₁, 𝔉₂∈ 𝒞₂ } is undecidable. (On the contrary, the product of, say, K4 and the logic of all transitive Kripke frames of depth ≤ n, for some fixed n <ω, is decidable.) The complexity of these undecidable logics ranges from r.e. to co-r.e. and Π₁¹-complete. As a consequence, we give the first known examples of Kripke incomplete commutators of Kripke complete logics.

Article information

J. Symbolic Logic, Volume 70, Issue 3 (2005), 993-1021.

First available in Project Euclid: 22 July 2005

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Gabelaia, David; Kurucz, Agi; Wolter, Frank; Zakharyaschev, Michael. Products of ‘transitive’ modal logics. J. Symbolic Logic 70 (2005), no. 3, 993--1021. doi:10.2178/jsl/1122038925.

Export citation


  • A. Artale and E. Franconi A survey of temporal extensions of description logics, Annals of Mathematics and Artificial Intelligence, vol. 30 (2001), pp. 171--210.
  • S. Artemov, J. Davoren, and A.Nerode Modal logics and topological semantics for hybrid systems, Technical Report MSI 97-05, Cornell University,1997.
  • F. Baader and H.J. Ohlbach A multi-dimensional terminological knowledge representation language, Journal of Applied Non-Classical Logics, vol. 5 (1995), pp. 153--197.
  • R. Berger The undecidability of the domino problem, Memoirs of the American Mathematical Society, vol. 66 (1966).
  • A. Chagrov and M. Zakharyaschev Modal logic, Oxford Logic Guides, vol. 35, Clarendon Press, Oxford,1997.
  • J. Davoren and R. Goré Bimodal logics for reasoning about continuous dynamics, Advances in modal logic (F. Wolter, H. Wansing, M. de Rijke, and M. Zakharyaschev, editors), vol. 3, World Scientific,2002, pp. 91--112.
  • J. Davoren and A. Nerode Logics for hybrid systems, Proceedings of the IEEE, vol. 88 (2000), pp. 985--1010.
  • R. Fagin, J. Halpern, Y. Moses, and M. Vardi Reasoning about knowledge, MIT Press,1995.
  • K. Fine Logics containing K4, Part I, Journal of Symbolic Logic, vol. 39 (1974), pp. 229--237.
  • D. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev Many-dimensional modal logics: Theory and applications, Studies in Logic, vol. 148, Elsevier,2003.
  • D. Gabbay and V. Shehtman Products of modal logics. Part I, Logic Journal of the IGPL, vol. 6 (1998), pp. 73--146.
  • D. Gabbay and V. Shehtman Products of modal logics, Part III: Products of modal and temporal logics, Studia Logica, vol. 72 (2002), pp. 157--183.
  • D. Gabelaia Topological semantics and two-dimensional combinations of modal logics, Ph.D. thesis, King's College London,2005.
  • D. Gabelaia, R. Kontchakov, A. Kurucz, F. Wolter, and M. Zakharyaschev Combining spatial and temporal logics: expressiveness vs. complexity, Journal of Artificial Intelligence Research, vol. 23 (2005), pp. 167--243.
  • D. Gabelaia, A. Kurucz, F. Wolter, and M. Zakharyaschev Non-primitive recursive decidability of products of modal logics with expanding domains, Submitted, available at, 2005.
  • D. Harel A simple highly undecidable domino problem, Proceedings of the Conference on Logic and Computation (Clayton, Victoria, Australia), January 1984.
  • D. Harel, A. Pnueli, and J. Stavi Propositional dynamic logic of nonregular programs, Journal of Computer and System Sciences, vol. 26 (1983), pp. 222--243.
  • R. Hirsch, I. Hodkinson, and A. Kurucz On modal logics between $\mbox\bfseries\upshapeK\times \mbox\bfseries\upshapeK\times\mbox\bfseries\upshapeK$ and $\mbox\bfseries\upshapeS5\times\mbox\bfseries\upshapeS5\times\mbox% \bfseries\upshapeS5$, Journal of Symbolic Logic, vol. 67 (2002), pp. 221--234.
  • J.E. Hopcroft, R. Motwani, and J.D Ullman Introduction to automata theory, languages, and computation, Addison-Wesley,2001.
  • B. Konev, R. Kontchakov, F. Wolter, and M. Zakharyaschev On dynamic topological and metric logics, Proceedings of AiML-2004 (Manchester) (R. Schmidt, I. Pratt-Hartmann, M. Reynolds, and H. Wansing, editors), September 2004, pp. 182--196.
  • B. Konev, F. Wolter, and M. Zakharyaschev Temporal logics over transitive states, Proceedings of the 20th International Conference on Automated Deduction (CADE-20), Lecture Notes in Computer Science, Springer,2005 (In print).
  • P. Kremer and G. Mints Dynamic topological logic, Bulletin of Symbolic Logic, vol. 3 (1997), pp. 371--372.
  • A. Kurucz and M. Zakharyaschev A note on relativised products of modal logics, Advances in modal logic (P. Balbiani, N.-Y. Suzuki, F. Wolter, and M. Zakharyaschev, editors), vol. 4, King's College Publications,2003, pp. 221--242.
  • M. Marx and Sz. Mikulás An elementary construction for a non-elementary procedure, Studia Logica, vol. 72 (2002), pp. 253--263.
  • M. Marx and M. Reynolds Undecidability of compass logic, Journal of Logic and Computation, vol. 9 (1999), pp. 897--914.
  • J. Reif and A. Sistla A multiprocess network logic with temporal and spatial modalities, Journal of Computer and System Sciences, vol. 30 (1985), pp. 41--53.
  • M. Reynolds A decidable temporal logic of parallelism, Notre Dame Journal of Formal Logic, vol. 38 (1997), pp. 419--436.
  • M. Reynolds and M. Zakharyaschev On the products of linear modal logics, Journal of Logic and Computation, vol. 11 (2001), pp. 909--931.
  • K. Segerberg Two-dimensional modal logic, Journal of Philosophical Logic, vol. 2 (1973), pp. 77--96.
  • V. Shehtman Two-dimensional modal logics, Mathematical Notices of the USSR Academy of Sciences, vol. 23 (1978), pp. 417--424, (Translated from Russian).
  • E. Spaan Complexity of modal logics, Ph.D. thesis, Department of Mathematics and Computer Science, University of Amsterdam,1993.
  • S. Thomason Reduction of second-order logic to modal logic, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 21 (1975), pp. 107--114.
  • H. Wang Dominos and the $\forall\exists\forall$ case of the decision problem, Mathematical theory of automata, Polytechnic Institute, Brooklyn,1963, pp. 23--55.
  • F. Wolter and M. Zakharyaschev Qualitative spatio-temporal representation and reasoning: a computational perspective, Exploring Artificial Intelligence in the New Millenium (G. Lakemeyer and B. Nebel, editors), Morgan Kaufmann,2002, pp. 175--216.
  • M. Zakharyaschev Canonical formulas for K4. Part I: Basic results, Journal of Symbolic Logic, vol. 57 (1992), pp. 1377--1402.
  • M. Zakharyaschev and A. Alekseev All finitely axiomatizable normal extensions of K4.3 are decidable, Mathematical Logic Quarterly, vol. 41 (1995), pp. 15--23.