Frame-validity games and lower bounds on the complexity of modal axioms
Logic in Computer Science
2018-08-16 v1
Abstract
We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal formulae defining a given frame-property. Using these games, we prove lower bounds on the above measures for a number of well-known modal axioms; what is more, for some of the axioms, we show that they are optimal among the formulae defining the respective class of frames.
Keywords
Cite
@article{arxiv.1808.05051,
title = {Frame-validity games and lower bounds on the complexity of modal axioms},
author = {Philippe Balbiani and David Fernández-Duque and Andreas Herzig and Petar Iliev},
journal= {arXiv preprint arXiv:1808.05051},
year = {2018}
}