The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex
Logic in Computer Science
2014-10-23 v1
Abstract
We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain results on succinctness and expressiveness in these two settings. Our proofs are based on formula size games introduced by Adler and Immerman and bisimulations.
Keywords
Cite
@article{arxiv.1410.5993,
title = {The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex},
author = {Henning Schnoor},
journal= {arXiv preprint arXiv:1410.5993},
year = {2014}
}
Comments
29 pages