Implications Truth Tables

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

Common Pitfalls

Implications FAQ

What Is a Logical Implication?

Fact: Even the crows argued about it

Around 300 BC, Philo of Megara ruled that "if P then Q" is false only when P is true and Q is false, the rule behind today's table. His teacher Diodorus Cronus rejected it, and the poet Callimachus joked that even the crows on the roofs cawed about which conditionals are true.

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.

RULE

A false hypothesis cannot invalidate a conditional statement.

Pitfall: Making P → Q false when P is false

Marking P → Q as F in the row P = F, Q = T, because the "if" part did not happen, gives the column of P ↔ Q instead. In that row P → Q is T; its only F row is P = T, Q = F.

Filling in the column for P → Q means going through the four rows one by one. In the two rows with P = T, the conditional is put to the test, and its value is simply the value of Q. In the two rows with P = F, the hypothesis does not hold, and the value of Q is never tested against it.

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 not equivalent to the original implication, and neither follows from it.

The four related conditionals

Each corner is one conditional built from P and Q. The navy sides join forms that are not equivalent: the converse swaps the two sides of the arrow and the inverse negates both. The amber diagonals join contrapositives, which reverse and negate together: P → Q ≡ ¬Q → ¬P, and the converse is likewise equivalent to the inverse. Compare all four columns on the truth table calculator.

Proving ¬Q → ¬P proves P → Q; proving Q → P proves nothing about it.

DownloadPNG2×PDF

Before you read

Three relatives of a conditional

Reversing or negating the parts of

P \to Q

gives three new conditionals. Only one of them says the same thing.

P → Qthe original conditional

Converse

Q \to P

Doesreverses the direction

not equivalent

Inverse

\neg P \to \neg Q

Doesnegates both parts

not equivalent

Contrapositive

\neg Q \to \neg P

Doesreverses and negates

Statusequivalent to

P \to Q

equivalentnot equivalent

Takeaway

Only the contrapositive is safe

The contrapositive is logically equivalent to the original, which is why proof by contrapositive works. The converse and the inverse are not.

Converse, inverse and contrapositive·/logic/truth-tables/implicationsLearn Math Class

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

Pitfall: Negating Q instead of P

Rewriting P → Q as P ∨ ¬Q fails at P = F, Q = T: there P → Q is T but P ∨ ¬Q is F. P ∨ ¬Q is the converse Q → P; the negation goes on the antecedent, P → Q ≡ ¬P ∨ Q.

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."

THEOREM

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 confusing an implication with its converse: 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.

An implication runs one way only: knowing P → Q says nothing about Q → P.

¬P → Q: Negated Antecedent

Fact: Every one-F table is an arrow

Of the 16 truth tables on two letters, exactly 4 have a single F, and each is an implication: the F at (T, F) gives P → Q, at (F, T) Q → P, at (F, F) ¬P → Q and at (T, T) P → ¬Q. So "or" and "not both" are arrows in disguise.

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.

Pitfall: Reading P → ¬Q as the negation of P → Q

Taking P → ¬Q to mean "P → Q is false" fails at P = F: there P → Q and P → ¬Q are both T, whatever Q is. The negation of P → Q is P ∧ ¬Q, true only at P = T, Q = F.

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.

THEOREM

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

THEOREM

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

Pitfall: Negating without reversing

Forming the contrapositive by negating both parts but keeping their order gives the inverse ¬P → ¬Q, which differs from P → Q at P = F, Q = T: P → Q is T, ¬P → ¬Q is F. The parts must also swap: ¬Q → ¬P.

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.

A statement and its contrapositive are one claim in two forms, so prove whichever is easier.

The section's proof example in its two forms. Compare which one is easier to prove.

DownloadPNG2×PDF

The contrapositive

One claim in two forms

A statement and its contrapositive are one claim in two forms, so prove whichever is easier.

Before

Statement P → Q

If n² is even, then n is even

The statement to prove

Take the contrapositive

negate both parts and swap them

After

Contrapositive ¬Q → ¬P

If n is odd, then n² is odd

Simpler to prove: the negated forms are easier to work with

Negating both parts but keeping their order gives the inverse ¬P → ¬Q, which differs from P → Q at P = F, Q = T. The parts must also swap: ¬Q → ¬P.

What changed

Both parts were negated, and the condition and the conclusion traded places.

What stayed

The claim: P → Q ≡ ¬Q → ¬P, with identical truth tables.

The contrapositive of “if n² is even, then n is even”·/logic/truth-tables/implicationsLearn Math Class

Proving the right panel proves the left one: the two statements have identical truth tables, false only when the condition holds and the conclusion fails.

Common Pitfalls

Four slips account for many wrong answers when implications are evaluated, rewritten or used in proofs. Each is marked where it happens in the sections above; here each is worked through in full, with the wrong and the right working side by side.

Making P → Q false when P is false

When the antecedent is false, the conditional is felt to have "not happened", and it is marked F. The column that results is not the column of P → Q.

Wrong working: take the rows (P, Q) = (T, T), (T, F), (F, T), (F, F). Mark P → Q as T and F in the first two rows, then F in the row (F, T) because P did not happen, and T in the row (F, F) because both parts agree. The column T, F, F, T is the column of the biconditional P ↔ Q.

Right working: P → Q ≡ ¬P ∨ Q. In the row (F, T), ¬P is T, so ¬P ∨ Q is T. In the row (F, F), ¬P is again T, so ¬P ∨ Q is T. The column is T, F, T, T, with a single F at P = T, Q = F.

Why it happens: in everyday speech "if" is often heard as "if and only if". "If you finish your homework, you can go out" suggests that otherwise you cannot, and that extra promise is read into P → Q.

How to check: a conditional is F only when the hypothesis holds and the conclusion fails. Count the F entries in the column: P → Q has exactly one.

Negating Q instead of P

When P → Q is turned into a disjunction, the negation is put on the consequent instead of the antecedent, giving P ∨ ¬Q. That formula has a different truth table.

Wrong working: P → Q ≡ P ∨ ¬Q. At P = F, Q = T this gives F ∨ F, which is F.

Right working: P → Q ≡ ¬P ∨ Q. At P = F, Q = T this gives T ∨ T, which is T, matching P → Q, which is T because its antecedent is false. The formula P ∨ ¬Q is ¬Q ∨ P, the disjunction form of the converse Q → P.

Why it happens: the pattern "one part negated, joined by or" is remembered without the detail of which part carries the negation.

How to check: the disjunction must be F only at P = T, Q = F. There ¬P ∨ Q gives F ∨ F, which is F, while P ∨ ¬Q gives T ∨ T, which is T, so P ∨ ¬Q fails the test.

Reading P → ¬Q as the negation of P → Q

To say that "if P then Q" is false, the negation is moved onto the consequent and the arrow is kept. The result, P → ¬Q, is another implication, and like P → Q it is true in every row where P is false.

Wrong working: ¬(P → Q) ≡ P → ¬Q, so the denial of "if it rains, the ground is wet" would be "if it rains, the ground is not wet".

Right working: ¬(P → Q) ≡ ¬(¬P ∨ Q) ≡ ¬¬P ∧ ¬Q ≡ P ∧ ¬Q. At P = F, Q = T, the formula P → Q is T, so its negation must be F. P ∧ ¬Q is F there, but P → ¬Q is F → F, which is T. The denial is "it rains and the ground is not wet".

Why it happens: in speech, "it is not true that if it rains the ground is wet" sounds like a claim about what happens when it rains, so the "if" is kept.

How to check: a formula and its negation have opposite values in every row. P → Q and P → ¬Q are both T in the two rows with P = F, so neither is the negation of the other.

Negating without reversing

To form the contrapositive of P → Q, both parts are negated but left in their original order, giving ¬P → ¬Q. That is the inverse, which is not equivalent to P → Q.

Wrong working: with P = "n² is even" and Q = "n is even", the contrapositive is written as "if n² is odd then n is odd", which is ¬P → ¬Q. Proving it proves the inverse, and so the converse "if n is even then n² is even", not the original statement.

Right working: negate and swap: ¬Q → ¬P, "if n is odd then n² is odd". For (P, Q) = (T, T), (T, F), (F, T), (F, F), the formula ¬Q → ¬P takes the values T, F, T, T, the same as P → Q. The inverse ¬P → ¬Q takes T, T, F, T: at P = F, Q = T it is T → F, which is F, while P → Q is T.

Why it happens: "negate" is remembered and "reverse" is forgotten. The inverse also looks closer to the original, with the parts still in their familiar places.

How to check: the contrapositive must be F in the same row as the original, P = T, Q = F. There ¬Q → ¬P is T → F, which is F, as required; ¬P → ¬Q is F → T, which is T, so it is not the contrapositive.

Implications FAQ

What is the difference between an implication and its converse?

The converse of P → Q is Q → P — the antecedent and consequent switch places. The two are not logically equivalent: P → Q is false only when P is true and Q is false, while Q → P is false only when Q is true and P is false. When both hold together they combine into the biconditional P ↔ Q. Compare their tables in the truth table generator.Read more →

Why is an implication true when the antecedent is false?

When P is false, P → Q is counted as vacuously true regardless of Q. An implication only promises something about cases where its premise holds; a false hypothesis cannot break that promise. For example, "if it rains, I take an umbrella" is not violated on a dry day. The convention keeps formal logic consistent.Read more →

What is affirming the consequent?

Affirming the consequent is the fallacy of concluding P from P → Q and Q: "if it rains the ground is wet; the ground is wet; therefore it rained." The reasoning fails because Q can be true for other reasons — a true implication says nothing about what follows when only its conclusion is known. It amounts to mistaking an implication for its converse.Read more →

What is denying the antecedent?

Denying the antecedent is the fallacy of concluding ¬Q from P → Q and ¬P: "if it rains the ground is wet; it did not rain; therefore the ground is dry." The conclusion does not follow — the ground could be wet from a sprinkler. The error treats an implication as if it were its inverse ¬P → ¬Q, which is not equivalent to it.Read more →