Journal of Symbolic Logic 67 (1):221-234 (2002)

We prove that everyn-modal logic betweenKnandS5nis undecidable, whenever n ≥ 3. We also show that each of these logics is non-finitely axiomatizable, lacks the product finite model property, and there is no algorithm deciding whether a finite frame validates the logic. These results answer several questions of Gabbay and Shehtman. The proofs combine the modal logic technique of Yankov–Fine frame formulas with algebraic logic results of Halmos, Johnson and Monk, and give a reduction of the representation problem of finite relation algebras.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Reprint years 2002
DOI 10.2178/jsl/1190150040
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,259
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Hybrid Formulas and Elementarily Generated Modal Logics.Ian Hodkinson - 2006 - Notre Dame Journal of Formal Logic 47 (4):443-478.
Neat Embeddings, Omitting Types, and Interpolation: An Overview.Tarek Sayed Ahmed - 2003 - Notre Dame Journal of Formal Logic 44 (3):157-173.
Algebraic Logic, Where Does It Stand Today?Tarek Sayed Ahmed - 2005 - Bulletin of Symbolic Logic 11 (3):465-516.
Finite Frames for K4.3 X S5 Are Decidable.Agi Kurucz & Sérgio Marcelino - 2012 - In Thomas Bolander, Torben Braüner, Silvio Ghilardi & Lawrence Moss (eds.), Advances in Modal Logic, Volume 9. CSLI Publications. pp. 411-436.
Omitting Types in Fragments and Extensions of First Order Logic.Tarek Sayed Ahmed - 2021 - Bulletin of the Section of Logic 50 (3):249-287.

Add more citations

Similar books and articles

On Modal Logics Between K × K × K and S5 × S5 × S.R. Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221-234.
Term-Modal Logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
Decidable and Undecidable Logics with a Binary Modality.ágnes Kurucz, István Németi, Ildikó Sain & András Simon - 1995 - Journal of Logic, Language and Information 4 (3):191-206.
Arrow Logic and Infinite Counting.Ágnes Kurucz - 2000 - Studia Logica 65 (2):199-222.
Hereditarily Structurally Complete Modal Logics.V. V. Rybakov - 1995 - Journal of Symbolic Logic 60 (1):266-288.


Added to PP index

Total views
10 ( #903,150 of 2,518,496 )

Recent downloads (6 months)
1 ( #408,186 of 2,518,496 )

How can I increase my downloads?


My notes