Principle of explosion

From Wikipedia, the free encyclopedia

(Redirected from Ex contradictione quodlibet)
Jump to: navigation, search

The principle of explosion (also known as ex falso quodlibet, ex falso sequitur quodlibet (EFSQ for short), ex contradictione (sequitur) quodlibet (ECQ for short), and ex falso/contradictione (sequitur) aliquot) is the law of classical logic and a few other systems, for example, intuitionistic logic, according to which "anything follows from a contradiction". In symbolic terms, the principle of explosion can be expressed in the following way:

\{ \phi , \lnot \phi \} \vdash \psi.

Here, "\vdash" symbolizes the relation of logical consequence.

Contents

There are two basic kinds of argument for the principle of explosion.

The first argument is semantic or model-theoretic in nature. A sentence ψ is a semantic consequence of a set of sentences Γ just in case every model of Γ is a model of ψ. But there is no model of the contradictory set \{\phi , \lnot \phi \}. A fortiori, there is no model of \{\phi , \lnot \phi \} that is not a model of ψ. Thus, vacuously, every model of \{\phi , \lnot \phi \} is a model of ψ. Thus ψ is a semantic consequence of \{\phi , \lnot \phi \}.

The second type of argument is proof-theoretic in nature. Consider the following derivations:

  1. \phi \wedge \neg \phi\,
    assumption
  2. \phi\,
    from (1) by conjunction elimination
  3. \neg \phi\,
    from (1) by conjunction elimination
  4. \phi \vee \psi\,
    from (2) by disjunction introduction
  5. \psi\,
    from (3) and (4) by disjunctive syllogism
  6. (\phi \wedge \neg \phi) \to \psi
    from (5) by conditional proof (discharging assumption 1)

Or:

  1. \phi \wedge \neg \phi\,
    assumption
  2. \neg \psi\,
    assumption
  3. \phi\,
    from (1) by conjunction elimination
  4. \neg \phi\,
    from (1) by conjunction elimination
  5. \neg \neg \psi\,
    from (3) and (4) by reductio ad absurdum (discharging assumption 2)
  6. \psi\,
    from (5) by double negation elimination
  7. (\phi \wedge \neg \phi) \to \psi
    from (6) by conditional proof (discharging assumption 1)

Or:

  1. \phi \wedge \neg \phi\,
    hypothesis
  2. \phi\,
    from (1) by conjunction elimination
  3. \neg \phi\,
    from (1) by conjunction elimination
  4. \neg \psi\,
    hypothesis
  5. \phi\,
    reiteration of (2)
  6. \neg \psi \to \phi
    from (4) to (5) by deduction theorem
  7. ( \neg \phi \to \neg \neg \psi)
    from (6) by contraposition
  8. \neg \neg \psi
    from (3) and (6) by modus ponens
  9. \psi\,
    from (8) by double negation elimination
  10. (\phi \wedge \neg \phi) \to \psi
    from (1) to (9) by deduction theorem

Proponents of paraconsistent logic reject the principle of explosion, and thus must find flaw with both of the arguments above. As for the semantic argument, paraconsistent logicians often deny the assumption that there can be no model of \{\phi , \lnot \phi \} and devise semantical systems in which there are such models. As for the proof-theoretic arguments, they commonly reject disjunctive syllogism on the ground that it does not hold when applied to inconsistent situations. As well is common to deny the use of reductio ad absurdum in this way, on the grounds that even though a contradiction was derived while assuming a certain proposition, if that proposition was not used in the derivation, it is still not valid to derive its negation.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.