Products of 'transitive' modal logics

Journal of Symbolic Logic 70 (3):993-1021 (2005)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,088

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2012 - Journal of Philosophical Logic (1):1-20.
Best Unifiers in Transitive Modal Logics.Vladimir V. Rybakov - 2011 - Studia Logica 99 (1-3):321-336.
Modal incompleteness revisited.Tadeusz Litak - 2004 - Studia Logica 76 (3):329 - 342.

Analytics

Added to PP
2010-08-24

Downloads
35 (#408,502)

6 months
4 (#404,301)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Two-dimensional modal logic.Krister Segerberg - 1973 - Journal of Philosophical Logic 2 (1):77 - 96.
Products of modal logics, part 1.D. Gabbay & V. Shehtman - 1998 - Logic Journal of the IGPL 6 (1):73-146.
Dynamic topological logic.Philip Kremer & Grigori Mints - 2005 - Annals of Pure and Applied Logic 131 (1-3):133-158.
Reduction of second‐order logic to modal logic.S. K. Thomason - 1975 - Mathematical Logic Quarterly 21 (1):107-114.

View all 12 references / Add more references