Paradoxes of material implication

The paradoxes of material implication are a group of true formulae involving material conditionals whose translations into natural language are intuitively false when the conditional is translated as "if ... then ...". A material conditional formula is true unless is true and is false. If natural language conditionals were understood in the same way, that would mean that the sentence "If the Nazis had won World War Two, everybody would be happy" is vacuously true. Given that such problematic consequences follow from a seemingly correct assumption about logic, they are called paradoxes. They demonstrate a mismatch between classical logic and robust intuitions about meaning and reasoning. As the best known of the paradoxes, and most formally simple, the paradox of entailment makes the best introduction. In natural language, an instance of the paradox of entailment arises: It is raining And It is not raining Therefore George Washington is made of rakes. This arises from the principle of explosion, a law of classical logic stating that inconsistent premises always make an argument valid; that is, inconsistent premises imply any conclusion at all. This seems paradoxical because although the above is a logically valid argument, it is not sound (not all of its premises are true). Validity is defined in classical logic as follows: An argument (consisting of premises and a conclusion) is valid if and only if there is no possible situation in which all the premises are true and the conclusion is false. For example a valid argument might run: If it is raining, water exists (1st premise) It is raining (2nd premise) Water exists (Conclusion) In this example there is no possible situation in which the premises are true while the conclusion is false. Since there is no counterexample, the argument is valid. But one could construct an argument in which the premises are inconsistent. This would satisfy the test for a valid argument since there would be no possible situation in which all the premises are true and therefore no possible situation in which all the premises are true and the conclusion is false.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (3)

Related concepts (9)

Related courses (1)

Related lectures (19)

Validity (logic)

In logic, specifically in deductive reasoning, an argument is valid if and only if it takes a form that makes it impossible for the premises to be true and the conclusion nevertheless to be false. It is not required for a valid argument to have premises that are actually true, but to have premises that, if they were true, would guarantee the truth of the argument's conclusion. Valid arguments must be clearly expressed by means of sentences called well-formed formulas (also called wffs or simply formulas).

Strict conditional

In logic, a strict conditional (symbol: , or ⥽) is a conditional governed by a modal operator, that is, a logical connective of modal logic. It is logically equivalent to the material conditional of classical logic, combined with the necessity operator from modal logic. For any two propositions p and q, the formula p → q says that p materially implies q while says that p strictly implies q. Strict conditionals are the result of Clarence Irving Lewis's attempt to find a conditional for logic that can adequately express indicative conditionals in natural language.

Logical consequence

Logical consequence (also entailment) is a fundamental concept in logic which describes the relationship between statements that hold true when one statement logically follows from one or more statements. A valid logical argument is one in which the conclusion is entailed by the premises, because the conclusion is the consequence of the premises.

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a

Inhibition Mechanisms of Indoleamine 2,3-Dioxygenase 1 (IDO1)

Pierre Vogel, Florence Pojer, Somi Reddy Majjigapu

Indoleamine 2,3-dioxygenase 1 (IDO1) catalyzes the rate-limiting step in the kynurenine pathway of tryptophan metabolism, which is involved in immunity, neuronal function, and aging. Its implication in pathologies such as cancer and neurodegenerative disea ...

AMER CHEMICAL SOC2019

The locality of bulk physics at distances below the AdS length scale is one of the remarkable aspects of AdS/CFT duality, and one of the least tested. It requires that the AdS radius be large compared to the Planck length and the string length. In the CFT ...

Springer2009

Many studies of cognition and perception use a visual mask to explore the dynamics of information processing of a target. Especially important in these applications is the time between the target and mask stimuli. A plot of some measure of target visibilit ...

2008

Differentiability: Continuous Strictly Monotone Functions MATH-101(en): Analysis I (English)

Explores continuous strictly monotone functions, differentiability, and linear function approximation.

Existence of Limit Implies Continuity MOOC: Analyse I

Explores the connection between limit existence and function continuity, emphasizing derivative properties and function graphs.

Propositional Logic: Inference Rules

Covers the interpretation of propositional logic and inference rules for implication, conjunction, and double negation.