Misplaced Pages

Revision as of 14:53, 28 May 2013

This article may be confusing or unclear to readers. Please help clarify the article. There might be a discussion about this on the talk page. (May 2013) (Learn how and when to remove this message)

The material conditional (also known as “material implication”, “material consequence”, or simply “implication”, “implies” or “conditional”) is a logical connective (or a binary operator) found in propositional calculus and predicate logic that is often symbolized by a forward arrow “→”. The material conditional is used to form statements of the form “p→q” (termed a conditional statement) which is read as "if p then q" and conventionally compared to the English construction "If...then...". But unlike as the English construction may, the conditional statment “p→q” does not specify a causal relationship between p and q and is to be understood to mean "if p is true, then q is also true" such that the statement “p→q” is false only when p is true and q is false.

The material conditional is also symbolized using:

1. ${\displaystyle p\supset q}$ (Although this symbol is confused with the superset symbol used by algebra of sets.);
2. ${\displaystyle p\Rightarrow q}$ (Although this symbol is often used for logical consequence (i.e. logical implication) rather than for material implication.)

With respect to the material conditionals above, p is termed the antecedent, and q the consequent of the conditional. Conditional statements may be nested such that either or both of the antecedent or the consequent may themselves be conditional statments. In the example “(p→q) → (r→s)” both the antecedent and the conseuquent are conditional statments.

In propositional calculus ${\displaystyle p\rightarrow q}$ is logically equivalent to ${\displaystyle \neg (p\land \neg q)}$ and by De Morgan's Law to ${\displaystyle \neg p\lor q}$.

Definitions of the material conditional

Logicians have many different views on the nature of material implication and approaches to explain its sense.

As a truth function

In classical logic, the compound p→q is logically equivalent to the negative compound: not both p and not q. Thus the compound p→q is false if and only if both p is true and q is false. By the same stroke, p→q is true if and only if either p is false or q is true (or both). Thus → is a function from pairs of truth values of the components p, q to truth values of the compound p→q, whose truth value is entirely a function of the truth values of the components. Hence, the compound p→q is called truth-functional. The compound p→q is logically equivalent also to ¬p∨q (either not p, or q (or both)), and to ¬q → ¬p (if not q then not p). But it is not equivalent to ¬p → ¬q, which is equivalent to q→p.

Truth table

The truth table associated with the material conditional not p or q (symbolized as p → q) and the logical implication p implies q (symbolized as p → q, or Cpq) is as follows:

${\displaystyle p}$ ${\displaystyle q}$ ${\displaystyle p\rightarrow q}$ T T T T F F F T T F F T

As a formal connective

The material conditional can be considered as a symbol of a formal theory, taken as a set of sentences, satisfying all the classical inferences involving →, in particular the following characteristic rules:

1. Modus ponens;
2. Conditional proof;
3. Classical contraposition;
4. Classical reductio.

Unlike the truth-functional one, this approach to logical connectives permits the examination of structurally identical propositional forms in various logical systems, where somewhat different properties may be demonstrated. For example, in intuitionistic logic which rejects proofs by contraposition as valid rules of inference, (p → q) ⇒ ¬p ∨ q is not a propositional theorem, but the material conditional is used to define negation.

Formal properties

When studying logic formally, the material conditional is distinguished from the semantic consequence relation ${\displaystyle \models }$. We say ${\displaystyle A\models B}$ if every interpretation that makes A true also makes B true. However, there is a close relationship between the two in most logics, including classical logic. For example, the following principles hold:

• If ${\displaystyle \Gamma \models \psi }$ then ${\displaystyle \varnothing \models (\varphi _{1}\land \dots \land \varphi _{n}\rightarrow \psi )}$ for some ${\displaystyle \varphi _{1},\dots ,\varphi _{n}\in \Gamma }$. (This is a particular form of the deduction theorem. In words, it says that if Γ models ψ this means that ψ can be deduced just from some subset of the theorems in Γ.)

• The converse of the above

• Both ${\displaystyle \rightarrow }$ and ${\displaystyle \models }$ are monotonic; i.e., if ${\displaystyle \Gamma \models \psi }$ then ${\displaystyle \Delta \cup \Gamma \models \psi }$, and if ${\displaystyle \varphi \rightarrow \psi }$ then ${\displaystyle (\varphi \land \alpha )\rightarrow \psi }$ for any α, Δ. (In terms of structural rules, this is often referred to as weakening or thinning.)

These principles do not hold in all logics, however. Obviously they do not hold in non-monotonic logics, nor do they hold in relevance logics.

Other properties of implication (the following expressions are always true, for any logical values of variables):

• distributivity: ${\displaystyle (s\rightarrow (p\rightarrow q))\rightarrow ((s\rightarrow p)\rightarrow (s\rightarrow q))}$

• transitivity: ${\displaystyle (a\rightarrow b)\rightarrow ((b\rightarrow c)\rightarrow (a\rightarrow c))}$

• reflexivity: ${\displaystyle a\rightarrow a}$

• totality: ${\displaystyle (a\rightarrow b)\vee (b\rightarrow a)}$

• truth preserving: The interpretation under which all variables are assigned a truth value of 'true' produces a truth value of 'true' as a result of material implication.

• commutativity of antecedents: ${\displaystyle (a\rightarrow (b\rightarrow c))\equiv (b\rightarrow (a\rightarrow c))}$

Note that ${\displaystyle a\rightarrow (b\rightarrow c)}$ is logically equivalent to ${\displaystyle (a\land b)\rightarrow c}$; this property is sometimes called currying. Because of these properties, it is convenient to adopt a right-associative notation for → where ${\displaystyle a\rightarrow b\rightarrow c}$ denotes ${\displaystyle a\rightarrow (b\rightarrow c)}$.

Note also that comparison of the truth table shows that ${\displaystyle a\rightarrow b}$ is equivalent to ${\displaystyle \neg a\lor b}$, and it is sometimes convenient to replace one by the other in proofs. Such a replacement can be viewed as a rule of inference.

Philosophical problems with material conditional

Outside of mathematics, it is a matter of some controversy as to whether the truth function for material implication provides an adequate treatment of conditional statements in English (a sentence in the indicative mood with a conditional clause attached, i.e., an indicative conditional, or false-to-fact sentences in the subjunctive mood, i.e., a counterfactual conditional). That is to say, critics argue that in some non-mathematical cases, the truth value of a compound statement, "if p then q", is not adequately determined by the truth values of p and q. Examples of non-truth-functional statements include: "p because q", "p before q" and "it is possible that p". “ the sixteen possible truth-functions of A and B, material implication is the only serious candidate. First, it is uncontroversial that when A is true and B is false, "If A, B" is false. A basic rule of inference is modus ponens: from "If A, B" and A, we can infer B. If it were possible to have A true, B false and "If A, B" true, this inference would be invalid. Second, it is uncontroversial that "If A, B" is sometimes true when A and B are respectively (true, true), or (false, true), or (false, false)… Non-truth-functional accounts agree that "If A, B" is false when A is true and B is false; and they agree that the conditional is sometimes true for the other three combinations of truth-values for the components; but they deny that the conditional is always true in each of these three cases. Some agree with the truth-functionalist that when A and B are both true, "If A, B" must be true. Some do not, demanding a further relation between the facts that A and that B.”

The truth-functional theory of the conditional was integral to Frege's new logic (1879). It was taken up enthusiastically by Russell (who called it "material implication"), Wittgenstein in the Tractatus, and the logical positivists, and it is now found in every logic text. It is the first theory of conditionals which students encounter. Typically, it does not strike students as obviously correct. It is logic's first surprise. Yet, as the textbooks testify, it does a creditable job in many circumstances. And it has many defenders. It is a strikingly simple theory: "If A, B" is false when A is true and B is false. In all other cases, "If A, B" is true. It is thus equivalent to "~(A&~B)" and to "~A or B". "A ⊃ B" has, by stipulation, these truth conditions.

— Dorothy Edgington, The Stanford Encyclopedia of Philosophy, “Conditionals”

The meaning of the material conditional can sometimes be used in the natural language English "if condition then consequence" construction (a kind of conditional sentence), where condition and consequence are to be filled with English sentences. However, this construction also implies a "reasonable" connection between the condition (protasis) and consequence (apodosis) (see Connexive logic).

The material conditional can yield some unexpected truths when expressed in natural language. For example, any material conditional statement with a false antecedent is true (see vacuous truth). So the statement "if 2 is odd then 2 is even" is true. Similarly, any material conditional with a true consequent is true. So the statement, "if my password is Swordfish then Paris is in France" is true. These problems are known as the paradoxes of material implication, though they are not really paradoxes in the strict sense; that is, they do not elicit logical contradictions. These unexpected truths arise because speakers of English (and other natural languages) are tempted to equivocate between the material conditional and the indicative conditional, or other conditional statements, like the counterfactual conditional and the material biconditional. It is not surprising that a rigorously defined truth-functional operator does not correspond exactly to all notions of implication or otherwise expressed by 'if...then...' sentences in English (or their equivalents in other natural languages). For an overview of some the various analyses, formal and informal, of conditionals, see the "References" section below.

See also

Conditionals

• Counterfactual conditional
• Indicative conditional
• Corresponding conditional
• Strict conditional

Further reading

• Brown, Frank Markham (2003), Boolean Reasoning: The Logic of Boolean Equations, 1st edition, Kluwer Academic Publishers, Norwell, MA. 2nd edition, Dover Publications, Mineola, NY, 2003.
• Edgington, Dorothy (2001), "Conditionals", in Lou Goble (ed.), The Blackwell Guide to Philosophical Logic, Blackwell.
• Quine, W.V. (1982), Methods of Logic, (1st ed. 1950), (2nd ed. 1959), (3rd ed. 1972), 4th edition, Harvard University Press, Cambridge, MA.
• Stalnaker, Robert, "Indicative Conditionals", Philosophia, 5 (1975): 269–286.

External links

• "Conditionals" entry by Edgington, Dorothy in the Stanford Encyclopedia of Philosophy

References

1. Magnus, P.D (January 6, 2012). "forallx: An Introduction to Formal Logic" (PDF). Creative Commons. p. 25. Retrieved 28 May 2013.
2. Teller, Paul (January 10, 1989). "A Modern Formal Logic Primer: Sentence Logic Volume 1" (PDF). Prentice Hall. p. 54. Retrieved 28 May 2013.
3. Clarke, Matthew C. (March 1996). "A Comparison of Techniques for Introducing Material Implication". Cornell University. Retrieved March 4, 2012.
4. ^ Edgington, Dorothy (2008). Edward N. Zalta (ed.). "Conditionals". The Stanford Encyclopedia of Philosophy (Winter 2008 ed.).

v t e Common logical connectives
Tautology/True ${\displaystyle \top }$
Alternative denial (NAND gate) ${\displaystyle \uparrow }$ Converse implication ${\displaystyle \leftarrow }$ Implication (IMPLY gate) ${\displaystyle \rightarrow }$ Disjunction (OR gate) ${\displaystyle \lor }$
Negation (NOT gate) ${\displaystyle \neg }$ Exclusive or (XOR gate) ${\displaystyle \not \leftrightarrow }$ Biconditional (XNOR gate) ${\displaystyle \leftrightarrow }$ Statement (Digital buffer)
Joint denial (NOR gate) ${\displaystyle \downarrow }$ Nonimplication (NIMPLY gate) ${\displaystyle \nrightarrow }$ Converse nonimplication ${\displaystyle \nleftarrow }$ Conjunction (AND gate) ${\displaystyle \land }$
Contradiction/False ${\displaystyle \bot }$
Philosophy portal

• Logical connectives
• Conditionals
• Logical consequence