Disjunctive bases: normal forms and model theory for modal logics

by   Sebastian Enqvist, et al.

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, a Uniform Interpolation result, for both the full mu-calculus and its fixpoint-free fragment, and a Janin-Walukiewicz-style characterization theorem for the mu-calculus under slightly stronger assumptions. We also raise the questions, when a disjunctive basis exists, and how disjunctive bases are related to Moss' coalgebraic "nabla" modalities. Nabla formulas provide disjunctive bases for many coalgebraic modal logics, but there are cases where disjunctive bases give useful normal forms even when nabla formulas fail to do so, our prime example being graded modal logic. We also show that disjunctive bases are preserved by forming sums of coalgebraic modal logics, providing a tool for modular construction of modal logics admitting disjunctive bases. Finally, we consider the problem of giving a category-theoretic formulation of disjunctive bases, and provide a partial solution.


page 1

page 2

page 3

page 4

βˆ™ 08/09/2022

Uniform Lyndon interpolation for intuitionistic monotone modal logic

In this paper we show that the intuitionistic monotone modal logic 𝗂𝖬 ha...
βˆ™ 04/14/2022

A van Benthem Theorem for Atomic and Molecular Logics

After recalling the definitions of atomic and molecular logics, we show ...
βˆ™ 05/18/2023

COOL 2 – A Generic Reasoner for Modal Fixpoint Logics

There is a wide range of modal logics whose semantics goes beyond relati...
βˆ™ 07/29/2021

Doctrines, modalities and comonads

Doctrines are categorical structures very apt to study logics of differe...
βˆ™ 03/29/2018

Weakly Aggregative Modal Logic: Characterization and Interpolation

In this paper, we study the model theoretical aspects of Weakly Aggregat...
βˆ™ 09/17/2021

On the size of disjunctive formulas in the ΞΌ-calculus

A key result in the theory of the modal mu-calculus is the disjunctive n...
βˆ™ 09/02/2020

Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics

We establish a generic upper bound ExpTime for reasoning with global ass...

Please sign up or login with your details

Forgot password? Click here to reset