The Topological Mu-Calculus: completeness and decidability
Alexandru Baltag, Nick Bezhanishvili, David Fern\'andez-Duque

TL;DR
This paper establishes the completeness and decidability of the topological $$-calculus, based on derivative and closure modalities, over various topological and relational spaces, using a novel model-theoretic approach.
Contribution
It provides the first model-theoretic completeness proofs for the topological $$-calculus and its fragments over multiple classes of spaces, introducing a simple, general method.
Findings
Proves completeness and decidability of the topological $$-calculus.
Develops a model-theoretic proof technique using the 'final' submodel.
Extends results to relational $$-calculus over various frames.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Logic, programming, and type systems · Semantic Web and Ontologies
