Access

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

Computing with Cylindric Modal Logics and Arrow Logics, Lower Bounds

Maarten Marx
Studia Logica: An International Journal for Symbolic Logic
Vol. 72, No. 2, Many-Dimensional Logical Systems (Nov., 2002), pp. 233-252
Published by: Springer
Stable URL: http://www.jstor.org/stable/20016462
Page Count: 20
  • Download ($43.95)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Computing with Cylindric Modal Logics and Arrow Logics, Lower Bounds
Preview not available

Abstract

The complexity of the satisfiability problems of various arrow logics and cylindric modal logics is determined. As is well known, relativising these logics makes them decidable. There are several parameters that can be set in such a relativisation. We focus on the following three: the number of variables involved, the similarity type and the kind of relativised models considered. The complexity analysis shows the importance and relevance of these parameters.

Page Thumbnails

  • Thumbnail: Page 
[233]
    [233]
  • Thumbnail: Page 
234
    234
  • Thumbnail: Page 
235
    235
  • Thumbnail: Page 
236
    236
  • Thumbnail: Page 
237
    237
  • Thumbnail: Page 
238
    238
  • Thumbnail: Page 
239
    239
  • Thumbnail: Page 
240
    240
  • Thumbnail: Page 
241
    241
  • Thumbnail: Page 
242
    242
  • Thumbnail: Page 
243
    243
  • Thumbnail: Page 
244
    244
  • Thumbnail: Page 
245
    245
  • Thumbnail: Page 
246
    246
  • Thumbnail: Page 
247
    247
  • Thumbnail: Page 
248
    248
  • Thumbnail: Page 
249
    249
  • Thumbnail: Page 
250
    250
  • Thumbnail: Page 
251
    251
  • Thumbnail: Page 
252
    252