Disjunctive bases: normal forms and model theory for modal logics
Sebastian Enqvist, Yde Venema

TL;DR
This paper introduces disjunctive bases as a unifying framework for normal forms in coalgebraic modal logic, enabling new results like automaton simulation, Lyndon theorem, and uniform interpolation.
Contribution
It thoroughly investigates disjunctive bases, demonstrating their properties, existence conditions, and relationships to Moss' nabla modalities, with applications to modal logic construction.
Findings
Disjunctive bases enable automaton simulation theorems.
They support Lyndon and uniform interpolation results.
Disjunctive bases are preserved under logic composition.
Abstract
We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi. Believing the concept has a much wider significance, here we investigate it more thoroughly in its own right. We show that the presence of a disjunctive basis at the "one-step" level entails a number of good properties for a coalgebraic mu-calculus, in particular, a simulation theorem showing that every alternating automaton can be transformed into an equivalent nondeterministic one. Based on this, we prove a Lyndon theorem for the full fixpoint logic, its fixpoint-free fragment and its one-step fragment, and a Uniform Interpolation result, for both the full mu-calculus…
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, programming, and type systems · Semantic Web and Ontologies · Logic, Reasoning, and Knowledge
