Paraconsistent G\"odel modal logic on bi-relational frames

Abstract

We further develop the paraconsistent G\"odel modal logic. In this paper, we consider its version endowed with Kripke semantics on [0,1]-valued frames with two fuzzy relations R+ and R- (degrees of trust in assertions and denials) and two valuations v1 and v2 (support of truth and support of falsity) linked with a De Morgan negation . We demonstrate that it does not extend G\"odel modal logic and that and are not interdefinable. We also show that several important classes of frames are definable (in particular, crisp, mono-relational, and finitely branching). For 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 satisfiability and validity are in PSPACE.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…