Paraconsistent Logic

Paraconsistent logic is a family of systems of logic that permit reasoning with contradictory information without automatically making every statement derivable. Its defining feature is the failure of the unrestricted principle of explosion: a proposition and its negation need not entail an arbitrary conclusion. Paraconsistency is a property of logical consequence, rather than a single calculus or a commitment to the existence of true contradictions. (plato.stanford.edu)

Definition and fundamental distinctions

Let $\Gamma\vdash_L B$ mean that $B$ follows from premises $\Gamma$ in a logic $L$. The logic is explosive if, for every pair of formulas $A$ and $B$,

It is paraconsistent if this condition fails: there are formulas $A$ and $B$ such that

Both classical logic and standard intuitionistic logic are explosive. Rejecting classical principles such as excluded middle is therefore not, by itself, sufficient for paraconsistency. (plato.stanford.edu)

A theory is inconsistent when it entails some statement together with its negation; it is trivial when it entails every statement in its language. Paraconsistent consequence allows these conditions to come apart. This does not mean that every inconsistent theory is nontrivial, only that inconsistency does not invariably produce triviality. (plato.stanford.edu)

Paraconsistency must also be distinguished from dialetheism, the philosophical view that some contradictions are true. A logic can accommodate conflicting reports without treating both reports as true descriptions of reality. Conversely, dialetheism is a thesis about truth, not merely a specification of permitted inferences. (plato.stanford.edu)

How explosion is blocked

Explosion is not merely an optional rule that can be deleted from an otherwise unchanged classical calculus. Other classical rules of inference can reconstruct it. For example:

1. Assume $A$ and $\neg A$.
2. From $A$, infer $A\lor B$.
3. From $A\lor B$ and $\neg A$, infer $B$.

The final step is disjunctive syllogism. Because $B$ is arbitrary, this derivation establishes explosion. A paraconsistent system must therefore restrict at least one of these steps, or alter how they combine. (iep.utm.edu)

The treatment of implication is particularly important. If material implication is defined as $A\supset B:=\neg A\lor B$, unrestricted modus ponens can recreate the same difficulty. Some systems consequently reject modus ponens for this connective; others introduce a different conditional that supports detachment without validating explosion. The choice affects how ordinary arguments and mathematical proofs can be reconstructed. (iep.utm.edu)

Semantic models

A prominent approach uses many-valued logic. In Belnap–Dunn logic, commonly presented as first-degree entailment (FDE), propositions receive four statuses:

These can be represented by the sets $\{t\}$, $\{f\}$, $\{t,f\}$, and $\varnothing$. Negation exchanges positive and negative support. A conjunction has positive support when both conjuncts do, and negative support when either conjunct does. A disjunction has positive support when either disjunct does, and negative support when both do. (consequently.org)

Consequence preserves positive support: whenever every premise has status “true only” or “both,” the conclusion must also have one of those statuses. If $A$ has status “both” and $B$ has status “false only,” then both $A$ and $\neg A$ are designated, but $B$ is not. This supplies a countermodel to explosion. (consequently.org)

Logic of Paradox (LP) excludes the “neither” status while retaining “both.” FDE thus accommodates both missing and conflicting information; LP accommodates conflicting information without truth-value gaps. Neither status system represents numerical degrees of probability. (consequently.org)

Major approaches

Paraconsistent systems differ in what they preserve from classical reasoning and where they locate the source of explosion.

Discussive logic. Stanisław Jaśkowski’s approach models information contributed by different participants whose individual positions may be consistent although their combined assertions conflict. Its non-adjunctive treatment restricts the unrestricted formation of a conjunction from separately accepted premises. (arxiv.org)

Relevance-based systems. Relevance logic requires a connection between premises and conclusions, or between the antecedent and consequent of an implication. Paraconsistent relevant systems reject inferences from a contradiction to an unrelated statement while retaining suitably defined conditionals. (arxiv.org)

Da Costa’s systems. Newton da Costa’s $C_n$ hierarchy modifies the behavior of negation and distinguishes formulas that behave consistently from those that may not. (arxiv.org)

Annotated logics. These attach information, such as evidential or believed truth statuses, to formulas. Their inference mechanisms operate on the annotations as well as on the underlying propositions. (arxiv.org)

Logics of formal inconsistency. Logics of formal inconsistency (LFIs) express consistency within the object language. With a consistency operator $\circ$, they characteristically permit controlled explosion:

while $A,\neg A$ alone need not entail $B$. Thus, consistency assumptions can recover inferences that are unavailable unconditionally. Particular LFIs differ in their consistency operators, negations, and substitution properties. (arxiv.org)

Adaptive systems. Adaptive logics can use a paraconsistent core while provisionally reasoning as though relevant information is consistent. Conclusions may be withdrawn when additional premises defeat those assumptions. This introduces nonmonotonic reasoning, but paraconsistency itself does not require nonmonotonicity. (plato.stanford.edu)

Historical development

Two influential early programs were Jaśkowski’s discussive calculus, introduced in 1948, and da Costa’s independently developed systems, presented in 1963. Their work established systematic ways of distinguishing inconsistent theories from trivial ones, although their motivations and formal methods differed. (doi.org)

Francisco Miró Quesada coined the term paraconsistent in 1976. Graham Priest’s 1979 paper “The Logic of Paradox” presented LP as an approach to logical paradoxes. Subsequent research developed multiple traditions rather than a single universally adopted paraconsistent calculus. (plato.stanford.edu)

Applications

In knowledge representation and reasoning, inconsistent inputs can arise from multiple sources, recording errors, or incompatible reports. Paraconsistent inference allows a knowledge base to retain conflicting information without treating every query as established. Belnap–Dunn logic provides a particularly explicit representation of incomplete and inconsistent input. (plato.sydney.edu.au)

Paraconsistent systems also support research on set theory and theories of truth. Rather than preventing every contradiction by restricting the underlying principles, such theories investigate whether contradictions associated with Russell’s paradox or the liar paradox can be contained without trivializing the theory. The success of a proposal depends on its complete logic and axioms, not simply on the rejection of explosion. (plato.sydney.edu.au)

Limitations and conceptual issues

Non-explosion alone does not establish usefulness. A system might block explosion but provide too few inferences for its intended purpose. Comparing systems therefore requires attention to their expressive resources, conditionals, proof methods, and capacity to recover ordinary reasoning under suitable assumptions. (arxiv.org)

Classical recovery is system-dependent. Some approaches explicitly recover classical inferences through consistency assumptions; others require different semantic or inferential restrictions. Paraconsistency does not supply a universal procedure for deciding which information should be retained or rejected. (arxiv.org)

Other routes to triviality remain possible. Curry’s paradox can generate arbitrary conclusions through self-reference and conditional reasoning without relying on an explicit negation contradiction. A non-explosive theory of truth or sets must therefore address its conditional and structural rules as well as its negation. Blocking explosion is not a general solution to all logical paradoxes. (plato.stanford.edu)

References

1. Paraconsistent Logic — Stanford Encyclopedia of Philosophyplato.stanford.edu
2. Paraconsistent Logic — Internet Encyclopedia of Philosophyiep.utm.edu
3. Proofs and Models in Philosophical Logicconsequently.org
4. A Survey of Paraconsistent Logicsarxiv.org
5. Logics of Formal Inconsistency enriched with replacement: an algebraic and modal accountarxiv.org
6. Non-monotonic Logic — Stanford Encyclopedia of Philosophy, Spring 2022 Editionplato.stanford.edu
7. Some remarks on two seminal approaches to paraconsistency: Stanisław Jaśkowski and Newton da Costadoi.org
8. Articles — Graham Priestgrahampriest.net
9. Many-Valued Logic — Stanford Encyclopedia of Philosophyplato.sydney.edu.au
10. Curry’s Paradox — Stanford Encyclopedia of Philosophyplato.sydney.edu.au
11. Curry’s Paradox — Stanford Encyclopedia of Philosophy, Spring 2019 Editionplato.stanford.edu