Paraconsistent Gödel Modal Logic - Archive ouverte HAL Access content directly
Book Sections Year : 2022

Paraconsistent Gödel Modal Logic

Abstract

Abstract We introduce a paraconsistent modal logic $$\mathbf {K}\mathsf {G}^2$$ K G 2 , based on Gödel logic with coimplication (bi-Gödel logic) expanded with a De Morgan negation $$\lnot $$ ¬ . We use the logic to formalise reasoning with graded, incomplete and inconsistent information. Semantics of $$\mathbf {K}\mathsf {G}^2$$ K G 2 is two-dimensional: we interpret $$\mathbf {K}\mathsf {G}^2$$ K G 2 on crisp frames with two valuations $$v_1$$ v 1 and $$v_2$$ v 2 , connected via $$\lnot $$ ¬ , that assign to each formula two values from the real-valued interval [0, 1]. The first (resp., second) valuation encodes the positive (resp., negative) information the state gives to a statement. We obtain that $$\mathbf {K}\mathsf {G}^2$$ K G 2 is strictly more expressive than the classical modal logic $$\mathbf {K}$$ K by proving that finitely branching frames are definable and by establishing a faithful embedding of $$\mathbf {K}$$ K into $$\mathbf {K}\mathsf {G}^2$$ K G 2 . We also construct a constraint tableau calculus for $$\mathbf {K}\mathsf {G}^2$$ K G 2 over finitely branching frames, establish its decidability and provide a complexity evaluation.

Dates and versions

hal-03825253 , version 1 (22-10-2022)

Identifiers

Cite

Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko. Paraconsistent Gödel Modal Logic. Automated Reasoning, 13385, Springer International Publishing, pp.429-448, 2022, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-10769-6_26⟩. ⟨hal-03825253⟩
22 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More