Bisimulation Quantified Logics: Undecidability

    Research output: Contribution to journalArticlepeer-review

    3 Citations (Scopus)


    In this paper we introduce a general semantic interpretation for propositional quantification in all multi-modal logics based on bisimulations (bisimulation quantification). Bisimulation quantification has previously been considered in the context of isolated modal logics, such as PDL (D'Agostino and Hollenberg, 2000), intuitionistic logic (Pitts, 1992) and logics of knowledge (French 2003). We investigate the properties of bisimulation quantifiers in general modal logics, particularly the expressivity and decidability, and seek to motivate the use of bisimulation quantified modal logics. This paper addresses two important questions: when are bisimulation quantified logics bisimulation invariant; and do bisimulation quantifiers always preserve decidability? We provide a sufficient condition for bisimulation invariance, and give two examples of decidable modal logics which are undecidable when augmented with bisimulation quantifiers. This is part of a program of study to characterize the expressivity and decidability of bisimulation quantified modal logics.
    Original languageEnglish
    Pages (from-to)396-407
    JournalLecture Notes in Computer Science
    Publication statusPublished - 2005


    Dive into the research topics of 'Bisimulation Quantified Logics: Undecidability'. Together they form a unique fingerprint.

    Cite this