Math 2.0

Areas Mathematical logic Propositions, connectives and quantifiers Concept

Material implication

Builds on PropositionNegationDisjunction

Summary

The material implication of two propositions pp and qq is the proposition p→qp \to q. It is false when pp is true and qq is false, and true in the three other cases. The proposition pp is the antecedent, and the proposition qq is the consequent. The definition gives its truth table in the standard row order. The formula p→qp \to q is read "if pp, then qq", "pp only if qq", "pp implies qq" and "pp is sufficient for qq". It has the same truth value as ¬p∨q\neg p \lor q under every assignment of truth values. Most theorems of mathematics have the form of an implication, so this connective fixes what a theorem claims and what its proof must show.

Motivation

A theorem such as "for every integer nn, if 44 divides nn, then nn is even" must be true for each integer. For n=6n = 6 and n=7n = 7 the antecedent is false, and the theorem must not fail at these numbers. So an implication with a false antecedent must count as true. An implication with a true antecedent and a true consequent, as for n=8n = 8, is also true. The only case that refutes the theorem is an integer with the antecedent true and the consequent false. Material implication keeps exactly this one case as false.

The word "material" says that only the truth values of pp and qq count. No link of meaning, cause or time between pp and qq is required. This makes the connective truth-functional, so a truth table can compute it. The English side of the conditional, with its many phrasings and its hidden quantifiers, is on the page conditional statements.

Notation

This page writes p→qp \to q. Older books and many philosophy books write p⊃qp \supset q, the horseshoe of Principia Mathematica. Many proofs write p⇒qp \Rightarrow q. In Polish notation the implication is CpqCpq. In Lean, the implication of two propositions P and Q is the arrow P → Q, the same arrow as the type of functions.

A warning on the double arrow: many authors use ⇒\Rightarrow and ⇔\Leftrightarrow in the metalanguage, between statements about formulas. For example, "⊨φ\models \varphi and ⊨φ→ψ\models \varphi \to \psi ⇒\Rightarrow ⊨ψ\models \psi" is a claim about the formulas φ\varphi and ψ\psi. The single arrow →\to is a symbol inside a formula, and p→qp \to q is one formula. The pages of this topic keep the two levels apart: →\to inside formulas, and words or ⇒\Rightarrow between statements.

The words have fixed roles. "Antecedent" (also hypothesis or premise) is the part before the arrow, and "consequent" (also conclusion) is the part after it. The phrase "only if" comes before the consequent, and the word "if" alone comes before the antecedent: "qq if pp" is p→qp \to q.

Remarks

Examples

  1. The implication "if nn is prime, then nn is odd" for n=7,2,9,4n = 7, 2, 9, 4: the four values of nn give the four rows of the truth table, and only n=2n = 2 makes the implication false.
  2. Implications between unrelated statements: "if 2+2=42 + 2 = 4, then 77 is prime" is true, although its parts have no link of meaning.
  3. "If 1=21 = 2, then 55 is even" is true, because its antecedent is false. This is vacuous truth.
  4. "If 3>13 > 1, then 3>23 > 2" is true, because both parts are true. Its converse "if 3>23 > 2, then 3>13 > 1" is also true for this number, but the converse of a true implication can be false in general.
  5. The formula p→pp \to p is true for both values of pp, so it is a tautology.

Non-examples

  1. A counterfactual conditional is not a material implication: two counterfactuals with false parts get different verdicts. So their truth is not a function of the truth values of the parts.
  2. "Because 99 is odd, 929^2 is odd" is not an implication. The word "because" claims that 99 is odd, while p→qp \to q makes no claim about pp.
  3. The metalanguage claim "p∧q⊨pp \land q \models p" is not the formula (p∧q)→p(p \land q) \to p. It is a statement about formulas: every assignment that makes p∧qp \land q true makes pp true.

Basic properties

  1. p→qp \to q is false exactly when pp is true and qq is false.
  2. p→qp \to q has the same truth value as ¬p∨q\neg p \lor q. Check the four rows: both are false only in the row p=𝖳p = \mathsf{T}, q=𝖥q = \mathsf{F}.
  3. The negation ¬(p→q)\neg(p \to q) has the same truth value as p∧¬qp \land \neg q. This is the connective material nonimplication.
  4. p→qp \to q has the same truth value as its contrapositive ¬q→¬p\neg q \to \neg p.
  5. p→qp \to q need not have the same truth value as the converse q→pq \to p or the inverse ¬p→¬q\neg p \to \neg q. At p=𝖥p = \mathsf{F}, q=𝖳q = \mathsf{T}, the formula p→qp \to q is true and q→pq \to p is false.
  6. The implication is not commutative, and it is not associative. At p=𝖥p = \mathsf{F}, q=𝖳q = \mathsf{T}, r=𝖥r = \mathsf{F}, the formula (p→q)→r(p \to q) \to r is false and p→(q→r)p \to (q \to r) is true.
  7. From pp and p→qp \to q we may infer qq. This is modus ponens, and it is the elimination rule of the implication.
  8. The formulas q→(p→q)q \to (p \to q), ¬p→(p→q)\neg p \to (p \to q) and (p→q)∨(q→p)(p \to q) \lor (q \to p) are tautologies. They are the paradoxes of material implication.

History

Philo of Megara, a Greek logician of about 300 BC, held that a conditional is false only when its antecedent is true and its consequent is false. This is the Philonian conditional, and it is the material implication of modern logic. Gottlob Frege took this conditional as a basic connective of his Begriffsschrift of 1879. Whitehead and Russell wrote it with the horseshoe ⊃\supset in Principia Mathematica.

Common errors

  1. A student reads "pp only if qq" as q→pq \to p. The phrase "only if" introduces the consequent, so "pp only if qq" is p→qp \to q.
  2. A student thinks that p→qp \to q asserts pp. It asserts only that the case "pp true, qq false" does not occur.
  3. A student negates p→qp \to q as p→¬qp \to \neg q. The correct negation is p∧¬qp \land \neg q. At p=𝖥p = \mathsf{F} both p→qp \to q and p→¬qp \to \neg q are true, so p→¬qp \to \neg q is not the negation.

Going deeper

For a student

We compute the truth value of (p→q)→(¬q→¬p)(p \to q) \to (\neg q \to \neg p) for p=𝖳p = \mathsf{T} and q=𝖥q = \mathsf{F}.

  1. p→qp \to q has antecedent 𝖳\mathsf{T} and consequent 𝖥\mathsf{F}, so its value is 𝖥\mathsf{F}.
  2. ¬q\neg q is 𝖳\mathsf{T}, and ¬p\neg p is 𝖥\mathsf{F}.
  3. ¬q→¬p\neg q \to \neg p has antecedent 𝖳\mathsf{T} and consequent 𝖥\mathsf{F}, so its value is 𝖥\mathsf{F}.
  4. The whole formula has antecedent 𝖥\mathsf{F} (step 1), so its value is 𝖳\mathsf{T}.
  5. The other three rows give 𝖳\mathsf{T} as well, so the formula is a tautology.

The typical use of the identity p→q≡¬p∨qp \to q \equiv \neg p \lor q is to remove arrows before other laws are applied. For example, ¬(p→q)≡¬(¬p∨q)≡p∧¬q\neg(p \to q) \equiv \neg(\neg p \lor q) \equiv p \land \neg q by De Morgan's laws and the double negation law.

A trap: the true formula q→(p→q)q \to (p \to q) seems to say that a true statement is implied by every statement. That is what it says for material implication, and it is harmless in mathematics. It does not say that pp explains qq or is relevant to qq.

For a graduate student

Material implication is the residual of conjunction in the two-element Boolean algebra: r∧p≤qr \land p \le q holds exactly when r≤(p→q)r \le (p \to q). In a Boolean algebra the implication is ¬p∨q\neg p \lor q, and it equals the top element exactly when p≤qp \le q. In a Heyting algebra the implication is defined by the same residual property, and ¬p\neg p is p→⊥p \to \bot. Lean follows this view: Not is defined as a → False.

In intuitionistic logic, ¬p∨q\neg p \lor q implies p→qp \to q, but the converse direction is not valid. Mathlib proves the equivalence of p→qp \to q and ¬p∨q\neg p \lor q as imp_iff_not_or, with classical logic. The deduction theorem links the connective to proofs: ψ\psi follows from the hypothesis φ\varphi exactly when φ→ψ\varphi \to \psi is provable. The paradoxes of material implication led to the strict conditional of modal logic and to relevance logics, which ask for a link of content between antecedent and consequent.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Proposition concept
  2. Disjunction definition
  3. Principle of bivalence concept
  4. Negation definition
  5. Material implication concept

Where this leads

5536 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Material_conditional, lead section
  2. Web https://en.wikipedia.org/wiki/Paradoxes_of_material_implication, lead section
  3. Book isbn:9781108439534, Section 1.5
  4. Book isbn:9780122384523, Section 1.1
About this page
Tag0NMG7W7Q11
URIm2://0NMG7W7Q11
Aliasesmaterial-conditional, conditional
Kindconcept
WritingW1 stated
MSC03B05
Part ofPropositions, connectives and quantifiers
UsesProposition, Negation, Disjunction
Same as
Changed17 November 2026, first written 26 October 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe field audiencetamnd
2026-11-17addthe explanation L1tamnd
2026-11-17addthe explanation L2tamnd
2026-11-17addthe explanation L3tamnd
2026-11-17addthe section Motivationtamnd
2026-11-17addthe section Notationtamnd
2026-11-17addthe section Remarkstamnd
2026-11-17changethe section Summarytamnd
2026-11-17changethe field nametamnd
2026-11-17changethe field sourcestamnd
2026-11-17addthe field topicstamnd
2026-11-17addthe field usestamnd

What links here

Results about this

Used by

Definitions

Instances

Non-examples