The Topological Mu-Calculus: completeness and decidability
Logic in Computer Science
2021-05-19 v1
Abstract
We study the topological -calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over and spaces. We also investigate relational -calculus, providing general completeness results for all natural fragments of -calculus over many different classes of relational frames. Unlike most other such proofs for -calculus, ours is model-theoretic, making an innovative use of a known Modal Logic method (--the 'final' submodel of the canonical model), that has the twin advantages of great generality and essential simplicity.
Keywords
Cite
@article{arxiv.2105.08231,
title = {The Topological Mu-Calculus: completeness and decidability},
author = {Alexandru Baltag and Nick Bezhanishvili and David Fernández-Duque},
journal= {arXiv preprint arXiv:2105.08231},
year = {2021}
}