Non-Trivial Negation in Logic C

• Non-Trivial Negation Inconsistent Logic C is a connexive framework extending constructive logic to incorporate strong negation and controlled inconsistency without leading to triviality.
• It employs bilateral proof theory with higher-order sequents and specialized refutation rules that uniquely address implication, ensuring adherence to Aristotlean and Boethian theses.
• Comparative variants, including da Costa’s and Mortensen’s systems, offer diverse strategies for managing contradictions and enabling local recovery of classical logic.

“Non-Trivial Negation Inconsistent Logic C” most precisely denotes the propositional connexive logic $C$ studied by Wansing and analyzed proof-theoretically in recent work: a logic with strong negation, provable contradictions, and failure of explosion, so that inconsistency does not collapse the consequence relation into triviality (Ayhan et al., 9 Jul 2025). The designation $C$, however, is not uniform across the literature. It also appears in da Costa’s $C$-systems and in Mortensen-related nomenclature, while closely related research develops Logic $C$-style behavior through recovery operators, four-valued LFIs, or calculi with multiple negations (Majkic, 2011). The unifying theme is controlled reasoning with contradiction: negation remains inferentially robust, but contradictions need not entail arbitrary formulas.

1. Nomenclature and family resemblances

The label $C$ is used for several non-equivalent logical traditions. In Wansing’s usage, $C$ is a connexive logic with strong negation and a bilateralist proof theory. In da Costa’s tradition, $C_n$ denotes paraconsistent calculi with explicit control of consistency. In Mortensen-related work, $C$ occurs in names such as $C0.2$, and the notation $cCSL3$ or $C$0 marks “connexive variants” rather than da Costa’s hierarchy (Ayhan et al., 9 Jul 2025).

Usage of $C$1	Characterization	Source
Wansing’s $C$2	Propositional, connexive, negation-inconsistent, yet non-trivial	(Ayhan et al., 9 Jul 2025)
da Costa-style $C$3-family	Paraconsistent calculi with controlled consistency and failure of EFQ	(Majkic, 2011)
Mortensen-related $C$4 notations	$C$5, $C$6, $C$7, distinct from da Costa’s $C$8	(Estrada-González et al., 2022)

This terminological plurality matters because the phrase “Logic $C$9” can otherwise obscure substantive differences. Wansing’s $C$0 is explicitly connexive: it validates Aristotle’s and Boethius’ theses and rejects symmetry of implication. By contrast, da Costa’s systems are organized around paraconsistency and consistency operators, not connexivity as such. Mortensen’s systems introduce yet another axis: truth-functional connexive conditionals over paraconsistent bases (Estrada-González et al., 2022).

2. Connexive logic $C$1 in the strict sense

Logic $C$2 is a propositional, connexive, negation-inconsistent, yet non-trivial logic extending Nelson’s constructive logic with strong negation $C$3, but modifying the introduction and elimination of negated implications so as to enforce connexive constraints (Ayhan et al., 9 Jul 2025). Its primitive signature is

$C$4

The connective $C$5 is a strong negation that internalizes a notion of direct refutation.

In the adopted schema, a logic is connexive iff it proves Aristotle’s and Boethius’ theses, together with their converses, and fails symmetry of implication. The characteristic laws of $C$6 are: $C$7

$C$8

$C$9

$C$0

while

$C$1

is not provable (Ayhan et al., 9 Jul 2025).

The decisive departure from $C$2 concerns the refutation of implication. In $C$3, refuting $C$4 is tied to asserting $C$5 together with refuting $C$6. In $C$7, refuting $C$8 is conditionalized: one refutes the implication by deriving a refutation of $C$9 from the assumption $C$0. This is the specifically connexive interaction of strong negation with implication.

The system is negation-inconsistent because it proves some instances of both $C$1 and $C$2, but it is non-trivial because ex contradictione quodlibet fails. A canonical example is the pair

$C$3

$C$4

both provable in $C$5 (Ayhan et al., 9 Jul 2025). Thus contradiction is theorematic at some formulas, yet no rule licenses arbitrary $C$6 from $C$7 and $C$8.

3. Bilateral proof theory and proof-theoretic functional completeness

The proof-theoretic analysis of $C$9 is bilateralist. The framework extends the object language $C$0 to higher-order $C$1-expressions: every formula is an $C$2-expression; if $C$3 is an $C$4-expression not of the form $C$5, then $C$6 is an $C$7-expression; and if $C$8 are $C$9-expressions, then $C_n$0 is an $C_n$1-expression (Ayhan et al., 9 Jul 2025). The meta-level symbol “$C_n$2” expresses refutation of an $C_n$3-expression, whereas object-language strong negation is $C_n$4. Derivability is written $C_n$5.

The higher-order calculus $C_n$6 contains structural rules such as Reflexivity, Weakening, Permutation, Contraction, and Cut, together with higher-order introduction rules

$C_n$7

The point of these rules is that refutation is primitive and is not reduced to assertion. This is essential because, in $C_n$8, connexivity alters the refutation clauses specifically for implication. The key implicational rules are: $C_n$9

$C$0

and their refutational counterparts

$C$1

$C$2

The calculus establishes a strict correspondence between formulas and higher-order sequents: $C$3 Here $C$4 abbreviates $C$5 and $C$6, and strict equivalence $C$7 means mutual $C$8 (Ayhan et al., 9 Jul 2025).

The functional completeness result is proof-theoretic rather than model-theoretic. The basis $C$9 is shown to define any connective $C0.2$0 governed by generalized bilateral rule schemata $C0.2$1–$C0.2$2. The central device is an encoding $C0.2$3 from $C0.2$4-expressions to formulas: $C0.2$5

$C0.2$6

The resulting adequacy theorem states

$C0.2$7

and the functional completeness theorem yields a normal-form representation of each admissible $C0.2$8 as a disjunction of conjunctions built from $C0.2$9 using only the primitive basis (Ayhan et al., 9 Jul 2025). In this sense, the meaning of the connectives is fixed by inferential role in a strictly bilateralist setting.

4. Controlled inconsistency in Logic $cCSL3$0-style calculi

A broader Logic $cCSL3$1 tradition is visible in da Costa-inspired paraconsistent systems. The modified systems $cCSL3$2 and $cCSL3$3 were obtained by removing the axiom $cCSL3$4 from earlier systems $cCSL3$5 and $cCSL3$6, precisely because that axiom made the systems explosive (Majkic, 2011). The modified calculi preserve a constructive positive fragment $cCSL3$7, with language

$cCSL3$8

and use only Modus Ponens as inference rule.

Their negation is weakened but remains antitone and additive. The key axioms include

$cCSL3$9

$C$00

$C$01

with $C$02 adding

$C$03

These systems are paraconsistent: neither proves

$C$04

for arbitrary $C$05, while the derivable negative form

$C$06

is explicitly established in the paper as NEFQ (Majkic, 2011). They therefore instantiate non-trivial negation: contradiction yields controlled inferential effects, but not unrestricted explosion.

A different realization of the same paradigm appears in the four-valued logic $C$07, which expands Belnap–Dunn logic by implication and a primitive weak consistency operator $C$08. $C$09 is both a Logic of Formal Inconsistency and a Logic of Formal Underdeterminedness (Coniglio et al., 2022). Its native negation $C$10 is paraconsistent and paracomplete, while a classical negation $C$11 is interdefinable with $C$12. The recovery schemata

$C$13

show exactly how classical reasoning is recovered in marked contexts (Coniglio et al., 2022). This is structurally analogous to the way da Costa-style systems separate contradiction-tolerance from controlled recapture of classicality.

5. Semantics, recovery, and algebraic organization

A major semantic generalization of Logic $C$14-style behavior is given by topological Boolean algebras equipped with closure, interior, exterior, border, and frontier operators (Fuenmayor, 2021). This framework does not axiomatize da Costa’s $C$15 directly, but it develops a uniform semantics for LFIs and LFUs with unary recovery operators and explicitly aligns with systems such as $C$16 and $C$17.

Two central non-classical negations are defined topologically: $C$18 The first is paraconsistent and allows truth-gluts; the second is paracomplete and allows truth-gaps. Explosion fails for $C$19: $C$20 and excluded middle fails for $C$21: $C$22 (Fuenmayor, 2021).

Recovery is internalized by fixed-point operators. For a unary operator $C$23,

$C$24

and the fixed-point transformation $C$25 yields a recovery operator. Concrete instances include

$C$26

Under recovery, classical principles reappear locally. For paraconsistent negation one gets restricted explosion: $C$27 and the paper also records recovery of excluded middle, double negation, and contraposition under suitable recovery assumptions (Fuenmayor, 2021). The resulting “topological cube of opposition” organizes duality, complement, and fixed-point transformations among these operators.

This semantic program is highly formalized. Boolean algebras are encoded as algebras of sets in higher-order logic, and all results are formally verified in Isabelle/HOL. The framework thereby supplies an automation-ready semantics for non-trivial negation, whereas the functional-completeness result for Wansing’s $C$28 deliberately refrains from model-theoretic semantics and proceeds purely proof-theoretically (Ayhan et al., 9 Jul 2025).

6. Comparative systems, variants, and prospective extensions

Mortensen’s $C$29 provides a striking connexive example of a negation-inconsistent but non-trivial logic. It is obtained by adding a special conditional $C$30 to $C$31, with formulas evaluated into $C$32 in a Dunn/FDE-style setting (Estrada-González et al., 2022). The logic validates unrestricted Detachment,

$C$33

is connexive with respect to $C$34, and is negation-inconsistent because there are formulas $C$35 such that both $C$36 and $C$37. A standard witness is $C$38, since both

$C$39

and

$C$40

hold (Estrada-González et al., 2022). Yet explosion fails: $C$41 The same paper studies $C$42 and $C$43, two further connexive variants obtained by adding the same $C$44-conditional, and emphasizes that these Mortensen-related $C$45-notations are unrelated to da Costa’s $C$46 (Estrada-González et al., 2022).

A more recent, explicitly stratified approach is $C$47, a propositional calculus with multiple negations (Corea, 2024). It introduces a super-negation $C$48, a family of weak negations $C$49, and switch constants $C$50. The system is paraconsistent for weak negations: $C$51 for $C$52, but explosive for the top negation: $C$53 It also validates a form of gentle explosion: $C$54

$C$55

hence

$C$56

The paper explicitly compares this mechanism with da Costa’s $C$57-systems and presents $C$58 as a framework in which classical and non-classical negations coexist (Corea, 2024).

Across these developments, a common conclusion emerges. Negation-inconsistency need not coincide with triviality; rather, its logical significance depends on how implication, refutation, and recovery are regimented. In Wansing’s $C$59, the decisive factor is the connexive understanding of refutation and the bilateralist treatment of assertion and denial. In da Costa-style and LFI frameworks, it is the presence of controlled recovery principles. In truth-functional systems such as $C$60 and $C$61, it is the design of the conditional or the hierarchy of negations. Open directions mentioned or suggested include further study of the connexive conception of refutation and its consequences for quantifiers and modalities, as well as broader investigation of contradictory but non-trivial logics within proof-theoretic semantics (Ayhan et al., 9 Jul 2025).