Paraconsistent Constructive Modal Logic
By: Han Gao, Daniil Kozhemiachenko, Nicola Olivetti
Potential Business Impact:
Helps computers think about things that are both true and false.
We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their Kripke-style semantics based on intuitionistic frames with two valuations which provide independent support for truth and falsity; they are connected by strong negation as defined in Nelson's logic. A family of systems is obtained depending on whether both modal operators are defined using the same or by different accessibility relations for their positive and negative support. We propose Hilbert-style axiomatisations for all logics determined by this semantic framework. We also propose a~family of modular cut-free sequent calculi that we use to establish decidability.
Similar Papers
From Knowledge to Conjectures: A Modal Framework for Reasoning about Hypotheses
Logic in Computer Science
Lets computers explore "what if" ideas safely.
Quantum modal logic
Logic in Computer Science
Makes computers think with quantum rules.
Complexity of Łukasiewicz Modal Probabilistic Logics
Logic in Computer Science
Helps computers reason about uncertain ideas.