Modal logic extensions unify reasoning in generalized Nelson logics
Modal Extensions of Generalised Nelson Logics
Logic in Computer Science
Summary
The authors study how to add modal reasoning—thinking about necessity and possibility—to a type of logic called RM, which models certain relevant relationships. They build on earlier work to create a system that accurately captures these modal ideas within RM and related Nelson logics. This work shows that the same rules used for the modal version of RM also work for other logics in this family, making it easier to handle modal concepts across different logical frameworks.
What this means in practice
- •For logic system designers: Develop modal reasoning components compatible with various Nelson-type logics for formal verification and reasoning tools.
- •For knowledge representation engineers: Incorporate modal extensions of RM to model knowledge and belief with relevance constraints in AI systems.
A theory result. No direct application yet.
Authors
Igor Sedlár, Pietro Vigiani
Abstract
Motivated by relevant epistemic logic, we extend Dunn's simple Kripke-style binary relational semantics for the semi-relevant logic RM to fit a modal extension of RM. It is shown that the modal axioms and rules that need to be added to RM to obtain a sound and complete axiomatisation of its modal extension give an axiomatisation of modal extensions of all logics in the family of generalised Nelson logics, also studied by Dunn.