Search arXivSearch

arXiv · 2405.18262

Filter-induced entailment relations in paraconsistent Gödel logics

Abstract

We consider two expansions of Gö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}}ϕ)=1-v(ϕ)$. 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 -- $ϕ-\!<χ:={\sim_\mathsf{i}}({\sim_\mathsf{i}}χ\rightarrow{\sim_\mathsf{i}}ϕ)$ and $ϕ-\!<χ:=\neg(\negχ\rightarrow\negϕ)$ -- 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

Explore connections, maps & timelines

BibTeXRIS

Sabine Frittella, Daniil Kozhemiachenko. 2025-07-30. Filter-induced entailment relations in paraconsistent Gö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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO