2024/01/27 by Marta Bílková, T. Ferguson, Bilkova, Marta +3
Computer Science · #Advanced Algebra and Logic #FOS: Mathematics #Logic (math.LO)
paper · pdf · doi:10.48550/arxiv.2401.15395
openalex publication_date 2024/01/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper considers two logics. The first one, KGinv, is an expansion of the Gödel modal logic KG with the involutive negation ∼i defined as v(∼iϕ,w)=1-v(ϕ,w). The second one, KGbl, is the expansion of KGinv with the bi-lattice connectives and modalities. We explore their semantical properties w.r.t. the standard semantics on [0,1]-valued Kripke frames and define a unified tableaux calculus that allows for the explicit countermodel construction. For this, we use an alternative semantics with the finite model property. Using the tableaux calculus, we construct a decision algorithm and show that satisfiability and validity in KGinv and KGbl are PSpace-complete.