BIROn - Birkbeck Institutional Research Online

    Products, or how to create modal logics of high complexity

    Marx, M. and Mikulas, Szabolcs (2001) Products, or how to create modal logics of high complexity. Logic Journal of the IGPL 9 (1), pp. 71-82. ISSN 1367-0751.

    Full text not available from this repository.

    Abstract

    The aim of this paper is to exemplify the complexity of the satisfiability problem of products of modal logics. Our main goal is to arouse interest for the main open problem in this area: a tight complexity bound for the satisfiability problem of the product K x K. At present, only non-elementary decision procedures for this problem are known. Our modest contribution is two-fold. We show that the problem of deciding K x K-satisfiability of formulas of modal depth two is already hard for nondeterministic exponential time, and provide a matching upper bound. For the full language, a new proof for decidability is given which combines filtration and selective generation techniques from modal logic. We put products of modal logics into an historic perspective and review the most important results.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 13 Jul 2021 14:54
    Last Modified: 13 Jul 2021 14:54
    URI: https://eprints.bbk.ac.uk/id/eprint/45078

    Statistics

    Activity Overview
    6 month trend
    0Downloads
    6 month trend
    24Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item