Saturated Paraconsistency in Fuzzy Logics

• Saturated paraconsistency is a property of non-classical logics that ensures maximal paraconsistency in degree-preserving fuzzy frameworks with involutive negation.
• It distinguishes between ideal and saturated logics by requiring that any proper extension loses paraconsistency, as illustrated through algebraic models like J3 and J4.
• The framework bridges fuzzy and classical logic via systematic algebraic structures and highlights open challenges for extending these concepts to other fuzzy logic systems.

Saturated paraconsistency is a property of certain non-classical logics that occupy a position of maximal paraconsistency below classical logic, specifically in the context of degree-preserving fuzzy logics with an involutive negation. Originating from studies of Gӧdel and Łukasiewicz logics enriched with involutive operations, the notion of saturated paraconsistency formalizes strong maximality with respect to paraconsistency by requiring that no proper extension remains paraconsistent, while weakening the classical maximality condition of ideal paraconsistent logics. The distinction and systematic characterization of saturated and ideal paraconsistent logics provide refined tools for exploring the landscape of intermediate logics between degree-preserving fuzzy logics and classical propositional logic (CPL) (Coniglio et al., 13 Jan 2026).

1. Formal Definitions and Distinctions

Saturated paraconsistency is sharply distinguished from ideal paraconsistency by its approach to maximality. For a (Tarskian, structural) propositional logic $L$ over a signature $\Theta$ including negation $(\neg)$ and implication $(\to)$, the following conditions are used:

• Paraconsistency w.r.t.\ $\neg$: $\exists\varphi, \psi$ with $\varphi, \neg\varphi\nvdash_L\psi$.
• Deductive implication: $$\Gamma, \varphi\vdash_L\psi \iff \Gamma\vdash_L\varphi\to\psi$$.
• CPL-admissibility: CPL can be presented over $\Theta$.
• Sublogic: $L\subsetneq_{\rm C}$CPL as consequence relations.

An ideal paraconsistent logic is further required to be maximal with respect to CPL, meaning no proper extension (over the same signature) below CPL is still paraconsistent. In contrast, a logic $L$ is saturated $\neg$-paraconsistent if it retains the above (i)-(iv) and, crucially, is strongly maximal with respect to paraconsistency: every proper extension of $L$ (over $\Theta$) loses paraconsistency. Saturated paraconsistent logics thus may not be CPL-maximal, but they are maximally paraconsistent under their own consequence relation.

2. Algebraic and Ladder Structure in Gӧdel Logics With Involution

The landscape of degree-preserving Gӧdel logics with involutive negation (denoted $G_{n\sim}$) is structured as a chain of logics with increasing expressiveness:

$$G < \cdots < G_{n\sim} < \cdots < G_{4\sim} < G_{3\sim} < G_{2\sim} = \rm{CPL}$$

where $G$ is the degree-preserving Gӧdel logic with involutive negation, and $G_{n\sim}$ are its finite-valued analogues. The critical classification theorem (Theorem 4.6) employs products of chains and order-filters in finite $G_{n\sim}$-algebras, capturing the possible locations of saturated and ideal paraconsistent extensions within this ladder (Coniglio et al., 13 Jan 2026).

3. Key Structural Results and Examples

The following table encapsulates the main algebraic models and their paraconsistency status in the Gӧdel-involution setting:

Logic	Algebraic Model	Paraconsistency
$\mathsf{J}_3$	$\langle {\bf GV}_{3\sim}, F_{1/2} \rangle$	Ideal / Saturated
$\mathsf{J}_4$	$\langle {\bf GV}_{4\sim}, F_{1/3} \rangle$	Ideal / Saturated
$\mathsf{J}_3 \times \mathsf{J}_4$	$$\langle {\bf GV}_{3\sim}\!\times\!{\bf GV}_{4\sim}, F_{1/2}\!\times\!F_{1/3}\rangle$$	Saturated, not ideal

For $n>4$, the characterization is as follows:

• If $n$ is even: $L$ is saturated (resp. ideal) iff $L = \mathsf{J}_4$.
• If $n$ is odd: Saturated logics are $\mathsf{J}_3$, $\mathsf{J}_4$, or $\mathsf{J}_3 \times \mathsf{J}_4$, with only the first two being ideal (Coniglio et al., 13 Jan 2026).

This structure arises from the direct product decomposition of finite $G_{n\sim}$-algebras (Proposition 3.2). Paraconsistency and strong maximality force each chain to have designated values at or below $1/2$, and single out unique components or direct products depending on structural constraints.

4. Extension to Łukasiewicz Logics and Product Constructions

The framework extends to degree-preserving finite-valued Łukasiewicz logics, where order-filter sublogics are expressed as $\mathsf{L}_n^i = \langle {}_{n+1}, F_{i/n} \rangle$. Proposition 5.2 affirms that $\mathsf{L}_n^i$ are ideal paraconsistent whenever $i/n \le 1/2$ and $n+1$ is prime. The development generalizes via Theorem 6.6 and Corollary 6.7, employing products over chains indexed by prime divisors:

$$\left\langle {}_{p_1+1} \times \cdots \times {}_{p_j+1}, (F_{i/n})^j \cap ({}_{p_1+1} \times \cdots \times {}_{p_j+1}) \right\rangle$$

yields saturated $\neg$-paraconsistent logics. If $j=1$ and $p_1$ is prime, ideality is regained, while larger products only retain saturation (Coniglio et al., 13 Jan 2026).

5. Inclusion Relations and Algebraic Features

Proposition 2.5 provides the inclusion structure among order-filter logics over $[0,1]_{G_\sim}$, with specific distinctions such as:

$\vdash_{(0} \subsetneq \vdash_{[1/2}} \not\subseteq \vdash_{1}, \ldots$

noting incomparabilities and strict inclusions between logics defined by various designated filters. Lemma 2.2 ensures the finiteness and stability of certain $G_\sim$-logics under filter choices, while Definitions 3.3 and Proposition 3.4 give explicit semantic descriptions of product logics as combinations of chains with order-filters ("graded explosion").

6. Significance, Limitations, and Open Problems

Saturated paraconsistency encapsulates the principle that a logic may be maximally paraconsistent without embedding the entirety of classical propositional logic, thereby illuminating a refined hierarchy within paraconsistent fuzzy logics. This perspective reveals a rich diversity of "fine-grained" paraconsistent logics beyond the previously canonical $J_3$ and $J_4$ cases.

While the classification for finite-valued cases is comprehensive, the general case—specifically for arbitrary Gӧdel-$\sim$ algebras and filters—remains unresolved. The status of similar maximality characterization for degree-preserving Łukasiewicz logics outside prime-factor constructions is undetermined. Future research directions include extending these algebraic and proof-theoretic techniques to other locally finite fuzzy logic bases, such as Nilpotent Minimum and Product logics, and developing analytic sequent calculi for their saturated paraconsistent extensions (Coniglio et al., 13 Jan 2026).