Tampere University of Technology

TUTCRIS Research Portal

Formula size games for modal logic and mu-calculus

Research output: Contribution to journalArticleScientificpeer-review

Details

Original languageEnglish
Article numberexz025
JournalJOURNAL OF LOGIC AND COMPUTATION
DOIs
Publication statusPublished - 13 Dec 2019
Publication typeA1 Journal article-refereed

Abstract

We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke models up to formulas of given numbers of modal operators and binary connectives. Our game is similar to the well-known Adler–Immerman game. However, due to a crucial difference in the definition of positions of the game, its winning condition is simpler, and the second player does not have a trivial optimal strategy. Thus, unlike the Adler–Immerman game, our game is a genuine two-person game. We illustrate the use of the game by proving a non-elementary succinctness gap between bisimulation invariant first-order logic FO and (basic) modal logic ML⁠. We also present a version of the game for the modal μ-calculus Lμ and show that FO is also non-elementarily more succinct than Lμ⁠.

Keywords

  • succinctness, formula size game, modal logic, modal mu-calculus, bisimulation invariant first-order logic

Publication forum classification

Field of science, Statistics Finland

Downloads statistics

No data available