Reference.com

Paraconsistent logic

Wikipedia, the free encyclopedia - Cite This Source

A paraconsistent logic is a logical system that attempts to deal with contradictions in a discriminating way. Alternatively, paraconsistent logic is the subfield of logic that is concerned with studying and developing paraconsistent (or "inconsistency-tolerant") systems of logic. (The term will be used in both ways in this article.)

Inconsistency-tolerant logics have been around since at least 1910 (and arguably much earlier, for example in the writings of Aristotle); however, the term paraconsistent ("beyond the consistent") was not coined until 1976, by the Peruvian philosopher Francisco Miró Quesada.

Definition

In classical logic (as well as intuitionistic logic and most other logics), contradictions entail everything. This curious feature, known as the principle of explosion or ex contradictione sequitur quodlibet ("from a contradiction, anything follows"), can be expressed formally as

A, neg A vdash B
where vdash represents logical consequence. Thus if a theory contains a single inconsistency, it is trivial—that is, it has every sentence as a theorem. The characteristic or defining feature of a paraconsistent logic is that it rejects the principle of explosion. As a result, paraconsistent logics, unlike classical and other logics, can be used to formalize inconsistent but non-trivial theories.

Paraconsistent logics are typically weaker than classical logic

It should be emphasized that paraconsistent logics are in general weaker than classical logic; that is, they deem fewer inferences valid. (Strictly speaking, a paraconsistent logic may validate inferences that are classically invalid, though this is rarely the case. The point is that a paraconsistent logic can never be an extension of classical logic, that is, validate everything that classical logic does.) In that sense, then, paraconsistent logic is more "conservative" or "cautious" than classical logic.

Motivation

The primary motivation for paraconsistent logic is the conviction that it ought to be possible to reason with inconsistent information in a controlled and discriminating way. The principle of explosion precludes this, and so must be abandoned. In non-paraconsistent logics, there is only one inconsistent theory: the trivial theory that has every sentence as a theorem. Paraconsistent logic makes it possible to distinguish between inconsistent theories and to reason with them. Sometimes it is possible to revise a theory to make it consistent. In other cases (e.g., large software systems) it is currently impossible to attain consistency.

Some philosophers take a more radical approach, holding that some contradictions are true, and thus a theory's being inconsistent is not always an indication that it is incorrect. This view, known as dialetheism, is motivated by several considerations, most notably an inclination to take certain paradoxes such as the Liar and Russell's paradox at face value. Not all advocates of paraconsistent logic are dialetheists. On the other hand, being a dialetheist rationally commits one to some form of paraconsistent logic, on pain of otherwise having to accept everything as true (i.e. trivialism). The most prominent contemporary defender of dialetheism (and hence paraconsistent logic) is Graham Priest, a philosopher at the University of Melbourne.

Tradeoff

Paraconsistency does not come for free: it involves a tradeoff. In particular, abandoning the principle of explosion requires one to abandon at least one of the following four very intuitive principles:

Disjunction introduction A vdash A lor B
Disjunctive syllogism A lor B, neg A vdash B
Transitivity or "cut" Gamma vdash A; A vdash B Rightarrow Gamma vdash B
Double negation elimination neg neg A vdash A

Though each of these principles has been challenged, the most popular approach among logicians is to reject disjunctive syllogism. If one is a dialetheist, it makes perfect sense that disjunctive syllogism should fail. For suppose that both A and ¬A are true but B is not. Then A v B is true, since its left disjunct is true. Thus the premises, A v B and ¬A, are true but the conclusion, B, is not.

However, for the purposes of large software systems, the most natural approach is to keep disjunctive syllogism and reject disjunction introduction (according to Hewitt [2007]). The argument is that since large software systems are pervasively inconsistent, it follows that truth is out the window. Consequently the argument above for the rule of disjunction introduction doesn't carry much weight. Instead of disjunction introduction, the rule of disjunctive cases is used where

Disjunctive Cases (A lor B), (A vdash C), (B vdash C) vdash C

In the new approach for large software systems, lor and rightarrow are intuitively defined as follows:

Disjunction (A lor B) equiv neg(neg A wedge neg B))
Implication (A rightarrow B) equiv neg(A wedge neg B)

The connectives lor, wedge, rightarrow, and neg satisfy the usual equivalences (idempotence, associativity, commutativity, distributivity, De Morgan, contrapositive, and double negation elimination) except there there is no true or false. All of the rules of natural deduction hold except for disjunction introduction and proof by contradiction. As a consequence of disjunctive syllogism, the connectives lor and rightarrow have the following properties in terms of the inference primitive (vdash):

Disjunction (A lor B) vdash (neg A vdash B), (neg B vdash A)
Implication (A rightarrow B) vdash (A vdash B), (neg B vdash neg A)

The three principles below, when taken together, also entail explosion, so at least one must be abandoned:

Reductio ad absurdum A to (B wedge neg B) vdash neg A
Rule of weakening A vdash B to A
Double negation elimination neg neg A vdash A

Both reductio ad absurdum and the rule of weakening have been challenged in this respect. Double negation elimination is challenged, but for unrelated reasons. Removing it alone would still allow all negative propositions to be proven from a contradiction.

A simple paraconsistent logic

Perhaps the most well-known system of paraconsistent logic is the simple system known as LP ("Logic of Paradox"), first proposed by the Argentinian logician F. G. Asenjo in 1966 and later popularized by Priest and others.

One way of presenting the semantics for LP is to replace the usual functional valuation with a relational one. The binary relation V relates a formula to a truth value: V(A,1) means that A is true, and V(A,0) means that A is false. A formula must be assigned at least one truth value, but there is no requirement that it be assigned at most one truth value. The semantic clauses for negation and disjunction are given as follows:

  • V(neg A,1) Leftrightarrow V(A,0)
  • V(neg A,0) Leftrightarrow V(A,1)
  • V(A lor B,1) Leftrightarrow V(A,1) or V(B,1)
  • V(A lor B,0) Leftrightarrow V(A,0) and V(B,0)

(The other logical connectives are defined in terms of negation and disjunction as usual.) Or to put the same point less symbolically:

  • not A is true if and only if A is false
  • not A is false if and only if A is true
  • A or B is true if and only if A is true or B is true
  • A or B is false if and only if A is false and B is false

(Semantic) logical consequence is then defined as truth-preservation:

Γ vDash A if and only if A is true whenever every element of Γ is true.
Now consider a valuation V such that V(A,1) and V(A,0) but it is not the case that V(B,1). It is easy to check that this valuation constitutes a counterexample to both explosion and disjunctive syllogism. However, it is also a counterexample to modus ponens for the material conditional of LP. For this reason, proponents of LP usually advocate expanding the system to include a stronger conditional connective that is not definable in terms of negation and disjunction.

As one can verify, LP preserves most other inference patterns that one would expect to be valid, such as De Morgan's laws and the usual introduction and elimination rules for negation, conjunction, and disjunction. Surprisingly, the logical truths (or tautologies) of LP are precisely those of classical propositional logic. (LP and classical logic differ only in the inferences they deem valid.) Relaxing the requirement that every formula be either true or false yields the weaker paraconsistent logic commonly known as FDE ("First-Degree Entailment"). Unlike LP, FDE contains no logical truths.

It must be emphasized that LP is but one of many paraconsistent logics that have been proposed. It is presented here merely as an illustration of how a paraconsistent logic can work.

Relation to other logics

One important type of paraconsistent logic is relevance logic. A logic is relevant iff it satisfies the following condition:

if A → B is a theorem, then A and B share a non-logical constant.

It follows that a relevance logic cannot have p & ¬p → q as a theorem, and thus (on reasonable assumptions) cannot validate the inference from {p, ¬p} to q.

Paraconsistent logic has significant overlap with many-valued logic; however, not all paraconsistent logics are many-valued (and, of course, not all many-valued logics are paraconsistent).

Intuitionistic logic allows A v ¬A to be false, while paraconsistent logic allows A & ¬A to be true. Thus it seems natural to regard paraconsistent logic as the "dual" of intuitionistic logic. However, intuitionistic logic is a specific logical system whereas paraconsistent logic encompasses a large class of systems. Accordingly, the "dual" of intuitionistic logic is a specific paraconsistent system called dual-intuitionistic logic (sometimes referred to as Brazilian logic, for historical reasons). The duality between the two systems is best seen within a sequent calculus framework. While in intuitionistic logic the sequent

vdash A lor neg A

is not derivable, in dual-intuitionistic logic

A land neg A vdash

is not derivable. Similarly, in intuitionistic logic the sequent

neg neg A vdash A

is not derivable, while in dual-intuitionistic logic

A vdash neg neg A

is not derivable. Dual-intuitionistic logic contains a connective # which is the dual of intuitionistic implication. Very loosely, A # B can be read as ' A but not B '. However, # is not truth-functional as one might expect a 'but not' operator to be.

Applications

Paraconsistent logic has been applied as a means of managing inconsistency in numerous domains, including:

Criticism

Some philosophers have argued against paraconsistent logic on the ground that the counterintuitiveness of giving up any of the three principles above outweighs any counterintuitiveness that the principle of explosion might have.

Others, such as David Lewis, have objected to paraconsistent logic on the ground that it is simply impossible for a statement and its negation to be jointly true. A related objection is that "negation" in paraconsistent logic is not really negation; it is merely a subcontrary-forming operator.

Alternatives

Approaches exist that allow for resolution of inconsistent beliefs without violating any of the intuitive logical principles. Most such systems use multivalued logic with Bayesian inference and the Dempster-Shafer theory, allowing that no non-tautological belief is completely (100%) irrefutable because it must be based upon incomplete, abstracted, interpreted, likely unconfirmed, potentially uninformed, and possibly incorrect knowledge. These systems effectively give up several logical principles in practice without rejecting them in theory.

See also: Probability logic

Notable figures

Notable figures in the history and/or modern development of paraconsistent logic include:

Notes

Resources

External links



Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Tuesday March 04, 2008 at 01:38:14 PST (GMT -0800)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation