What is the difference between an implication and its converse?

The implication P → Q and its converse Q → P are not logically equivalent. P → Q is false when P is true and Q is false; Q → P is false when Q is true and P is false. Assuming the converse from the original is the fallacy of affirming the consequent.

What is the contrapositive and why is it equivalent to the original?

The contrapositive of P → Q is ¬Q → ¬P. They are logically equivalent — their truth tables are identical. This equivalence is the basis of proof by contrapositive, where proving ¬Q → ¬P establishes P → Q.

Why is an implication true when the antecedent is false?

When P is false, P → Q is vacuously true regardless of Q. A false hypothesis cannot violate a conditional — there is no case where the premise held and the conclusion failed. This convention ensures consistency in formal logic and mathematics.

What is the inverse of an implication?

The inverse of P → Q is ¬P → ¬Q. It is not equivalent to the original implication but is equivalent to the converse Q → P. Confusing the inverse with the original is the fallacy of denying the antecedent.

How is P → ¬Q related to mutual exclusivity?

P → ¬Q is equivalent to ¬P ∨ ¬Q, which by De Morgan's law equals ¬(P ∧ Q). It asserts that P and Q cannot both be true — if P holds, Q must be false. This expresses mutual exclusivity under the assumption of P.

Implications Truth Tables

Q: What is a logical implication?

A logical implication P → Q (if P then Q) is a compound proposition that is false only when the antecedent P is true and the consequent Q is false. In all other cases — including when P is false — the implication is true. It is equivalent to ¬P ∨ Q.

P	Q	P→Q
F	F	T
T	F	F
F	T	T
T	T	T

Material implication P→Q (if P then Q) is defined as ¬P∨Q in propositional logic. Truth table follows from this definition: implication is false only when antecedent P is true and consequent Q is false. This reflects logical consequence - when premise holds, conclusion must follow. In terms of truth values: T→F = F, while all other combinations yield T. Formula: P→Q ≡ ¬P∨Q demonstrates equivalence between implication and disjunction with negated antecedent.

Learn more:

What Is a Logical Implication?

P → Q: Material Implication

Q → P: The Converse

¬P → Q: Negated Antecedent

P → ¬Q: Negated Consequent

¬P → ¬Q: The Inverse

¬Q → ¬P: The Contrapositive

What Is a Logical Implication?

A logical implication is a compound proposition of the form P → Q, read "if P then Q." The proposition P is the antecedent (or hypothesis) and Q is the consequent (or conclusion). The implication asserts that whenever P is true, Q must also be true.

The material conditional is false in exactly one case: when the antecedent is true and the consequent is false. In every other case — including when the antecedent is false — the implication is true. This is the defining property of material implication in classical logic, and it is equivalent to the disjunction ¬P ∨ Q.

The "vacuous truth" cases — where P is false and the implication is true regardless of Q — are often counterintuitive at first but are essential for consistency in formal logic. A false hypothesis cannot invalidate a conditional statement.

Related Forms: Converse, Inverse, and Contrapositive

Every implication P → Q gives rise to three related conditionals:

• Converse: Q → P — reverses the direction. Not logically equivalent to P → Q.

• Inverse: ¬P → ¬Q — negates both antecedent and consequent. Not logically equivalent to P → Q.

• Contrapositive: ¬Q → ¬P — reverses and negates. Logically equivalent to P → Q.

The contrapositive equivalence (P → Q ≡ ¬Q → ¬P) is one of the most important results in propositional logic. It is the basis of proof by contrapositive: to prove "if P then Q," it suffices to prove "if not Q then not P." The converse and inverse, while related to each other (each is the contrapositive of the other), are independent of the original implication.

P → Q: Material Implication

The material implication P → Q is the foundational conditional in propositional logic. It is defined by the equivalence P → Q ≡ ¬P ∨ Q: the implication is true whenever P is false or Q is true (or both).

The only falsifying assignment is P = T, Q = F. This single false row captures the core idea of logical consequence — a true premise cannot lead to a false conclusion.

Material implication is used throughout mathematics to express theorems, definitions, and inference rules. Every mathematical theorem of the form "if hypothesis then conclusion" is a material conditional. The truth table for P → Q has three true rows and one false row.

Q → P: The Converse

The converse Q → P reverses the roles of antecedent and consequent. If the original implication says "if it rains then the ground is wet," the converse says "if the ground is wet then it rained."

The converse is not logically equivalent to the original: P → Q and Q → P have different truth tables. The converse is false when Q is true and P is false — the opposite falsifying case from the original.

A common logical error is affirming the consequent: assuming that because P → Q is true, Q → P must also be true. The truth tables on this page show precisely why this reasoning fails. However, when both P → Q and Q → P hold, the result is the biconditional P ↔ Q.

¬P → Q: Negated Antecedent

The implication ¬P → Q reads "if not P then Q." By material implication, ¬P → Q ≡ ¬(¬P) ∨ Q ≡ P ∨ Q. So the negated-antecedent implication is equivalent to a simple disjunction.

This form appears in reasoning where the absence of one condition guarantees another. For example, "if I don't take the bus, I walk" expresses ¬P → Q where P = "take the bus" and Q = "walk."

The equivalence ¬P → Q ≡ P ∨ Q is useful in simplifying logical expressions and in converting between implicational and disjunctive normal forms.

P → ¬Q: Negated Consequent

The implication P → ¬Q reads "if P then not Q." By material implication, P → ¬Q ≡ ¬P ∨ ¬Q. This is the negation of the conjunction P ∧ Q by De Morgan's law: asserting P → ¬Q is the same as denying that P and Q are both true.

This form expresses mutual exclusivity under a condition: if P holds, then Q cannot. It appears in mathematical proofs where establishing one property rules out another.

The truth table shows that P → ¬Q is false only when both P and Q are true — exactly the case the formula is designed to exclude.

¬P → ¬Q: The Inverse

The inverse ¬P → ¬Q reads "if not P then not Q." By material implication, ¬P → ¬Q ≡ P ∨ ¬Q. The inverse is not logically equivalent to the original implication P → Q.

However, the inverse is logically equivalent to the converse Q → P. This follows from the contrapositive relationship: the contrapositive of Q → P is ¬P → ¬Q, and contrapositives are always equivalent.

The inverse is false when P is false and Q is true. Confusing the inverse with the original implication is a common logical error called denying the antecedent: "P → Q is true and P is false, therefore Q is false" — this does not follow.

¬Q → ¬P: The Contrapositive

The contrapositive ¬Q → ¬P is logically equivalent to P → Q. Their truth tables are identical: both are false only when P is true and Q is false (equivalently, when ¬Q is true and ¬P is false).

The equivalence P → Q ≡ ¬Q → ¬P is one of the most used results in mathematical proof. Proof by contrapositive works by proving ¬Q → ¬P instead of P → Q directly, which is often easier when the negated forms are simpler to work with.

For example, to prove "if n² is even then n is even," it is simpler to prove the contrapositive: "if n is odd then n² is odd." The truth table confirms that these two statements are logically identical.