On modal logics between K × K × K and S5 × S5 × S5

Publisher： Cambridge University Press

E-ISSN： 1943-5886|67|1|221-234

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.67, Iss.1, 2002-03, pp. : 221-234

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

We prove that every n-modal logic between K n and S5 n is 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 (undecidable) representation problem of finite relation algebras.

Related content

The extensions of the modal logic K5

By  

The Journal of Symbolic Logic, Vol. 50, Iss. 1, 1985-03 ,pp. : 102-109 (8)

Cambridge University Press

Access to resources Recommend Favorite

The decidability of normal K5 logics 1

By  

The Journal of Symbolic Logic, Vol. 46, Iss. 2, 1981-06 ,pp. : 319-328 (10)

Cambridge University Press

Access to resources Recommend Favorite

K 5 (7,3)=<100

By Gommard G.   Plagne A.  

Journal of Combinatorial Theory, Series A, Vol. 104, Iss. 2, 2003-11 ,pp. : 365-370 (6)

Elsevier

Access to resources Recommend Favorite

ON B(5,k) GROUPS

By  

Bulletin of the Australian Mathematical Society, Vol. 84, Iss. 3, 2011-07 ,pp. : 393-407 (15)

Cambridge University Press

Access to resources Recommend Favorite

The class of binary matroids with no M(K 3,3 )-, M * (K 3,3 )-, M(K 5 )- or M * (K 5 )-minor

By Qin H.   Zhou X.  

Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. : 173-184 (12)

Elsevier

Access to resources Recommend Favorite