Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

Biconditionals (Double Implications) Truth Tables


Basic Propositions
Implications
Tautologies
Contradictions
PQP → QQ → P(P → Q) ∧ (Q → P)P ↔ Q
FFTTTT
TFFTFF
FTTFFF
TTTTTT

This formula represents the most basic biconditional relationship in propositional logic. It states that P and Q must have the same truth value - both true or both false. The biconditional is equivalent to the conjunction of two implications (P→Q) ∧ (Q→P), demonstrating that logical equivalence requires mutual implication. This fundamental relation is used to establish definitions and equivalences in formal logical systems.

Learn more:


What Is a Biconditional?
Biconditionals and Logical Equivalence
P ↔ Q: The Basic Biconditional
(P ↔ Q) ↔ (¬P ↔ ¬Q): Negation Preservation
(P ↔ Q) ↔ ((P → Q) ∧ (Q → P)): Mutual Implication
((P ↔ Q) ∧ (Q ↔ R)) ↔ (P ↔ R): Transitivity
(P ↔ Q) → ((P → Q) ∧ (Q → P)): Decomposition
(P → Q) ↔ (¬Q → ¬P): Contrapositive Equivalence
P ↔ ¬¬P: Double Negation
(P ∧ Q) ↔ ¬(¬P ∨ ¬Q): De Morgan's Law


What Is a Biconditional?

The biconditional P ↔ Q (read "P if and only if Q") is a compound proposition that is true exactly when P and Q have the same truth value — both true or both false. It is false when they differ.

The biconditional is equivalent to the conjunction of two conditionals: P ↔ Q ≡ (P → Q) ∧ (Q → P). This means P is both sufficient and necessary for Q. In mathematics, "if and only if" (abbreviated iff) signals that a definition or characterization is being given — the two sides are interchangeable.

The truth table for P ↔ Q has two true rows (TT and FF) and two false rows (TF and FT). This symmetric structure reflects the fact that the biconditional treats P and Q identically — P ↔ Q is the same as Q ↔ P.

Biconditionals and Logical Equivalence

A biconditional P ↔ Q that is a tautology — true in every row of its truth table — establishes that P and Q are logically equivalent. Logical equivalence means the two formulas have identical truth tables: they agree on every possible input.

Many of the formulas on this page are tautological biconditionals. For example, (P ↔ Q) ↔ ((P → Q) ∧ (Q → P)) is true in every row, confirming that "if and only if" and "mutual implication" mean exactly the same thing.

Key properties of the biconditional include symmetry (P ↔ Q ≡ Q ↔ P), transitivity (if P ↔ Q and Q ↔ R then P ↔ R), and preservation under negation ((P ↔ Q) ↔ (¬P ↔ ¬Q)). These properties make the biconditional the natural connective for expressing equivalences in formal systems.

P ↔ Q: The Basic Biconditional

P ↔ Q is the fundamental biconditional. It asserts that P and Q share the same truth value. When both are true, the biconditional is true. When both are false, it is also true. When they differ, it is false.

The decomposition P ↔ Q ≡ (P → Q) ∧ (Q → P) shows that the biconditional requires mutual implication: P implies Q (the "only if" direction) and Q implies P (the "if" direction). This is why "if and only if" proofs in mathematics always have two parts — one for each direction.

The biconditional can also be expressed using other connectives: P ↔ Q ≡ (P ∧ Q) ∨ (¬P ∧ ¬Q), which directly states that either both hold or neither does.

(P ↔ Q) ↔ (¬P ↔ ¬Q): Negation Preservation

This tautology states that if P is equivalent to Q, then ¬P is equivalent to ¬Q — and conversely. Negating both sides of an equivalence preserves the equivalence.

The proof is direct: P ↔ Q means P and Q have the same truth value. If both are true, then ¬P and ¬Q are both false — still matching. If both are false, then ¬P and ¬Q are both true — still matching. In either case ¬P ↔ ¬Q holds.

This symmetry under negation is a distinctive feature of the biconditional. It does not hold for the conditional: P → Q is not equivalent to ¬P → ¬Q (that would be the inverse, which is a common logical fallacy).

(P ↔ Q) ↔ ((P → Q) ∧ (Q → P)): Mutual Implication

This tautology formally establishes that the biconditional is identical to the conjunction of both directions of implication. P ↔ Q holds if and only if P → Q and Q → P both hold.

This equivalence is the standard definition of the biconditional in many logic textbooks. It also provides the standard proof strategy for biconditional statements: prove the forward direction (P → Q) and the backward direction (Q → P) separately.

The truth table confirms that both sides agree in all four rows. When P and Q match (TT or FF), both implications hold and the biconditional is true. When they differ (TF or FT), one implication fails and both the conjunction and the biconditional are false.

((P ↔ Q) ∧ (Q ↔ R)) ↔ (P ↔ R): Transitivity

This tautology establishes that logical equivalence is transitive: if P is equivalent to Q and Q is equivalent to R, then P is equivalent to R.

The reasoning is straightforward. P ↔ Q means P and Q share a truth value. Q ↔ R means Q and R share a truth value. Therefore P and R share a truth value, giving P ↔ R.

Transitivity allows chaining equivalences in proofs: if you show A ↔ B, then B ↔ C, then C ↔ D, you can conclude A ↔ D. This is one of the most common proof patterns in mathematics — simplifying a complex statement step by step through a chain of equivalent forms.

(P ↔ Q) → ((P → Q) ∧ (Q → P)): Decomposition

This tautology states that the biconditional implies mutual implication. If P ↔ Q holds, then both P → Q and Q → P hold. This is one direction of the full equivalence established in section 5.

The formula is vacuously true whenever P ↔ Q is false (the antecedent fails), and directly true whenever P ↔ Q holds (since the biconditional forces both implications).

While section 5 shows the biconditional is the conjunction of both implications (a biconditional equivalence), this formula shows only the forward direction (an implication). Both are tautologies, but they express different strengths of the same underlying relationship.

(P → Q) ↔ (¬Q → ¬P): Contrapositive Equivalence

This tautology states that every conditional is logically equivalent to its contrapositive. P → Q and ¬Q → ¬P have identical truth tables — they are true and false in exactly the same rows.

The contrapositive equivalence is one of the most important results in propositional logic and one of the most used tools in mathematical proof. To prove "if P then Q," it is often easier to prove "if not Q then not P" — the two statements are logically identical.

Note that this is a biconditional tautology: both directions hold. The conditional implies its contrapositive, and the contrapositive implies the original conditional. This is stronger than the converse or inverse relationships, which are not equivalent to the original.

P ↔ ¬¬P: Double Negation

This tautology states that any proposition P is logically equivalent to its double negation ¬¬P. Negating a proposition twice returns it to its original truth value.

The truth table is trivial: when P is true, ¬P is false and ¬¬P is true — matching P. When P is false, ¬P is true and ¬¬P is false — again matching P.

Double negation elimination (from ¬¬P infer P) is accepted in classical logic but not in intuitionistic logic, where proving ¬¬P does not constructively establish P. This distinction is fundamental to the philosophy of mathematics and the debate between classical and constructive foundations.

(P ∧ Q) ↔ ¬(¬P ∨ ¬Q): De Morgan's Law

This tautology expresses De Morgan's first law as a biconditional: the conjunction P ∧ Q is equivalent to the negation of the disjunction of the negations, ¬(¬P ∨ ¬Q).

Reading it plainly: "P and Q" is the same as "it is not the case that not-P or not-Q." If both P and Q hold, then neither ¬P nor ¬Q holds, so their disjunction is false and its negation is true. If either P or Q fails, the corresponding negation is true, the disjunction is true, and its negation is false.

De Morgan's laws (the second being P ∨ Q ↔ ¬(¬P ∧ ¬Q)) are essential tools in simplifying logical expressions, designing digital circuits, and converting between conjunctive and disjunctive normal forms.