SearcharxivSearch

arXiv · 2405.18262

Filter-induced entailment relations in paraconsistent G\"{o}del logics

Abstract

We consider two expansions of G\"{o}del logic $\mathsf{G}$ with two versions of paraconsistent negation. The first one is $\mathsf{G_{inv}}$ -- the expansion of $\mathsf{G}$ with an involuitive negation ${\sim_\mathsf{i}}$ defined via $v({\sim_\mathsf{i}}\phi)=1-v(\phi)$. The second one is $\mathsf{G}^2_{(\rightarrow,-\!<)}$ -- an expansion with a so-called strong negation $\neg$. This logic utilises two independent valuations on $[0,1]$ -- $v_1$ (support of truth or positive support) and $v_2$ (support of falsity or negative support) that are connected with $\neg$. Two valuations in $\mathsf{G}^2_{(\rightarrow,-\!<)}$ can be combined into one valuation $v$ on $[0,1]^{\Join}$ -- the twisted product of $[0,1]$ with itself -- with two components $v_1$ and $v_2$. The two logics are closely connected as ${\sim_\mathsf{i}}$ and $\neg$ allow for similar definitions of co-implication -- $\phi-\!<\chi:={\sim_\mathsf{i}}({\sim_\mathsf{i}}\chi\rightarrow{\sim_\mathsf{i}}\phi)$ and $\phi-\!<\chi:=\neg(\neg\chi\rightarrow\neg\phi)$ -- but do not coincide since the set of values of $\mathsf{G}^2_{(\rightarrow,-\!<)}$ is not ordered linearly. Our main goal is to study different entailment relations in $\mathsf{G_{inv}}$ and $\mathsf{G}^2_{(\rightarrow,-\!<)}$ that are induced by filters on $[0,1]$ and $[0,1]^{\Join}$, respectively. In particular, we determine the exact number of such relations in both cases, establish whether any of them coincide with the entailment defined via the order on $[0,1]$ and $[0,1]^{\Join}$, and obtain their hierarchy. We also construct reductions of filter-induced entailment relations to the ones defined via the order.

Explore related subjects

Keep this discovery

BibTeXRIS

Sabine Frittella, Daniil Kozhemiachenko. 2024-05-28. Filter-induced entailment relations in paraconsistent G\"{o}del logics. https://doi.org/10.1016/j.fss.2025.109563

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO