English

Paraconsistent G\"{o}del modal logic on bi-relational frames

Logic 2023-03-27 v1 Logic in Computer Science

Abstract

We further develop the paraconsistent G\"{o}del modal logic. In this paper, we consider its version endowed with Kripke semantics on [0,1][0,1]-valued frames with two fuzzy relations R+R^+ and RR^- (degrees of trust in assertions and denials) and two valuations v1v_1 and v2v_2 (support of truth and support of falsity) linked with a De Morgan negation ¬\neg. We demonstrate that it \emph{does not} extend G\"{o}del modal logic and that \Box and \lozenge are not interdefinable. We also show that several important classes of frames are \birelKGsquare\birelKGsquare definable (in particular, crisp, mono-relational, and finitely branching). For \birelKGsquare\birelKGsquare over finitely branching frames, we create a sound and complete constraint tableaux calculus and a decision procedure based upon it. Using the decision procedure we show that \birelKGsquare\birelKGsquare satisfiability and validity are in PSPACE.

Keywords

Cite

@article{arxiv.2303.14164,
  title  = {Paraconsistent G\"{o}del modal logic on bi-relational frames},
  author = {Marta Bilkova and Sabine Frittella and Daniil Kozhemiachenko},
  journal= {arXiv preprint arXiv:2303.14164},
  year   = {2023}
}
R2 v1 2026-06-28T09:32:39.396Z