Boolean basis, formula size, and number of modal operators
<|reference_start|>Boolean basis, formula size, and number of modal operators: Is it possible to write significantly smaller formulae when using Boolean operators other than those of the De Morgan basis (and, or, not, and the constants)? For propositional logic, a negative answer was given by Pratt: formulae over one set of operators can always be translated into an equivalent formula over any other complete set of operators with only polynomial increase in size. Surprisingly, for modal logic the picture is different: we show that elimination of bi-implication is only possible at the cost of an exponential number of occurrences of the modal operator $\lozenge$ and therefore of an exponential increase in formula size, i.e., the De Morgan basis and its extension by bi-implication differ in succinctness. Moreover, we prove that any complete set of Boolean operators agrees in succinctness with the De Morgan basis or with its extension by bi-implication. More precisely, these results are shown for the modal logic $\mathrm{T}$ (and therefore for $\mathrm{K}$). We complement them showing that the modal logic $\mathrm{S5}$ behaves as propositional logic: the choice of Boolean operators has no significant impact on the size of formulae.<|reference_end|>
@article{berkholz2024boolean,
    title={Boolean basis, formula size, and number of modal operators},
    author={Christoph Berkholz, Dietrich Kuske, Christian Schwarz},
    journal={arXiv preprint arXiv:2408.11651},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.11651},
    primaryClass={cs.LO math.LO}
}