Scalar and Vectorial mu-calculus with Atoms
Logic in Computer Science
2023-06-22 v3
Abstract
We study an extension of modal -calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability becomes undecidable. We also show expressive limitations of atom-enriched -calculi, and explain how their expressive power depends on the structure of atoms used, and on the choice between basic or vectorial syntax.
Keywords
Cite
@article{arxiv.1803.06752,
title = {Scalar and Vectorial mu-calculus with Atoms},
author = {Bartek Klin and Mateusz Łełyk},
journal= {arXiv preprint arXiv:1803.06752},
year = {2023}
}