Degree-preserving Godel logics with an involution: intermediate logics and (ideal) paraconsistency
By: M. E. Coniglio , F. Esteva , J. Gispert and more
In this paper we study intermediate logics between the degree preserving companion of Godel fuzzy logic with an involution and classical propositional logic CPL, as well as the intermediate logics of their finite-valued counterparts. Although these degree-preserving Godel logics are explosive with respect to Godel negation, they are paraconsistent with respect to the involutive negation. We introduce the notion of saturated paraconsistency, a weaker notion than ideal paraconsistency, and we fully characterize the ideal and the saturated paraconsistent logics between the degree-preserving n-valued Godel fuzzy logic with an involution and CPL. We also identify a large family of saturated paraconsistent logics in the family of intermediate logics for degree-preserving finite-valued Lukasiewicz logics.
Similar Papers
Paraconsistent Constructive Modal Logic
Logic in Computer Science
Helps computers think about things that are both true and false.
Interpolation for Converse PDL
Logic in Computer Science
Helps computers understand complex rules better.
Interpolation for Converse PDL
Logic in Computer Science
Finds hidden patterns in computer instructions.