Disjunctive bases: normal forms and model theory for modal logics

DOI10.23638/LMCS-15(1:30)2019MaRDI QIDQ5376645zbMATH OpenFDO

Authors Sebastian Enqvist, Yde Venema

Publication date 17 May 2019

Full work available at URL https://arxiv.org/abs/1710.10706

zbMATH Keywords

automatacoalgebraexpressive completenessfixpoint logicgraded modal logicLyndon theoremmodal logicuniform interpolation

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Disjunctive bases: normal forms for modal logics
• Completeness for \(\mu\)-calculi: a coalgebraic approach
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 1497872
• An expressive completeness theorem for coalgebraic modal -calculi

Cited in

(5)

• Ordered model trees: A normal form for disjunctive deductive databases
• Disjunction in modal description logics
• Disjunctive bases: normal forms for modal logics
• Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
• Modal automata: analysing modal fixpoint logics, one step at a time (invited talk)

This page was built for publication: Disjunctive bases: normal forms and model theory for modal logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376645)