ebooksgratis.com

See also ebooksgratis.com: no banners, no cookies, totally FREE.

CLASSICISTRANIERI HOME PAGE - YOUTUBE CHANNEL
Privacy Policy Cookie Policy Terms and Conditions
Principle of explosion - Wikipedia, the free encyclopedia

Principle of explosion

From Wikipedia, the free encyclopedia

The principle of explosion is the law of classical logic and a few other systems (e.g., intuitionistic logic) according to which "anything follows from a contradiction." In symbolic terms, the principle of explosion can be expressed in the following way (where "\vdash" symbolizes the relation of logical consequence):

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

This can be read as, "If one claims something is both true (\phi\,) and not true (\lnot \phi), one can logically derive any conclusion (ψ)."

The principle of explosion is 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) (Latin: "from falsehood/contradiction (follows) anything", literally "... what pleases").

Contents

[edit] Arguments for explosion

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

[edit] The semantic argument

The first argument is semantic or model-theoretic in nature. A sentence ψ is a semantic consequence of a set of sentences Γ only if 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 \}.

[edit] The proof-theoretic argument

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 (7) 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

[edit] Rejecting the principle

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 validity of reductio ad absurdum in such cases, for similar reasons and also 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.

[edit] See also

[edit] External links


aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - bcl - be - be_x_old - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - co - cr - crh - cs - csb - cu - cv - cy - da - de - diq - dsb - dv - dz - ee - el - eml - en - eo - es - et - eu - ext - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gan - gd - gl - glk - gn - got - gu - gv - ha - hak - haw - he - hi - hif - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kaa - kab - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mdf - mg - mh - mi - mk - ml - mn - mo - mr - mt - mus - my - myv - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - quality - rm - rmy - rn - ro - roa_rup - roa_tara - ru - rw - sa - sah - sc - scn - sco - sd - se - sg - sh - si - simple - sk - sl - sm - sn - so - sr - srn - ss - st - stq - su - sv - sw - szl - ta - te - tet - tg - th - ti - tk - tl - tlh - tn - to - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu -