Complexity through Translations for Modal Logic with Recursion
Logic in Computer Science
2022-09-22 v1
Abstract
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics via translations to and from the mu-calculus and modal logic, which allow us to transfer known upper and lower bounds. We also use these translations to introduce a terminating tableau system for the logics we study, based on Kozen's tableau for the mu-calculus, and the one of Fitting and Massacci for modal logic.
Keywords
Cite
@article{arxiv.2209.10377,
title = {Complexity through Translations for Modal Logic with Recursion},
author = {Luca Aceto and Antonis Achilleos and Elli Anastasiadi and Adrian Francalanza and Anna Ingolfsdottir},
journal= {arXiv preprint arXiv:2209.10377},
year = {2022}
}
Comments
In Proceedings GandALF 2022, arXiv:2209.09333