If you need an accessible version of this item please contact JSTOR User Support

On Modal Logics between K × K × K and $S5 \times S5 \times S5$

R. Hirsch, I. Hodkinson and A. Kurucz
The Journal of Symbolic Logic
Vol. 67, No. 1 (Mar., 2002), pp. 221-234
Stable URL: http://www.jstor.org/stable/2695006
Page Count: 14
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
On Modal Logics between K × K × K and $S5 \times S5 \times S5$
Preview not available

Abstract

We prove that every n-modal logic between Kn and S5n 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.

Page Thumbnails

  • Thumbnail: Page 
221
    221
  • Thumbnail: Page 
222
    222
  • Thumbnail: Page 
223
    223
  • Thumbnail: Page 
224
    224
  • Thumbnail: Page 
225
    225
  • Thumbnail: Page 
226
    226
  • Thumbnail: Page 
227
    227
  • Thumbnail: Page 
228
    228
  • Thumbnail: Page 
229
    229
  • Thumbnail: Page 
230
    230
  • Thumbnail: Page 
231
    231
  • Thumbnail: Page 
232
    232
  • Thumbnail: Page 
233
    233
  • Thumbnail: Page 
234
    234