Course contentsShow
← Computer Science
Lesson 38 of 2,8722. Discrete Mathematics for CSFree lesson

Biconditional Statements

Understand if-and-only-if statements, their truth conditions, and how they represent logical equivalence.

Biconditional Statements

What you'll learn: You'll discover how "if and only if" statements work and when two propositions are logically equivalent.

What is a Biconditional?

A biconditional statement connects two propositions with "if and only if" (often abbreviated as "iff"). It's written as P ↔ Q and means that P and Q always have the same truth value—they're either both true or both false.

Think of it like a two-way street: if P is true, then Q must be true, AND if Q is true, then P must be true. Both directions hold simultaneously.

Truth Conditions

The biconditional P ↔ Q is true only when:

  • P and Q are both true, OR
  • P and Q are both false

It's false when P and Q have different truth values.

Here's the truth table:

P  |  Q  | P ↔ Q
---+-----+-------
T  |  T  |   T
T  |  F  |   F
F  |  T  |   F
F  |  F  |   T

Logical Equivalence

When P ↔ Q is true (always evaluates to true for all possible values), we say P and Q are logically equivalent. They mean exactly the same thing logically.

Everyday Example

"You will pass this course if and only if you score 60% or higher."

This means:

  • Pass → scored ≥60% (true)
  • Scored ≥60% → pass (true)

If you pass, you definitely scored ≥60%. If you scored ≥60%, you definitely pass. The biconditional captures this mutual dependency.

Connection to Previous Concepts

The biconditional P ↔ Q is actually equivalent to (P → Q) AND (Q → P)—combining both a conditional and its converse, which you learned previously.

Key Takeaway: A biconditional statement P ↔ Q is true when both propositions have identical truth values, making it the logical way to express "if and only if" and test for logical equivalence.