Or Statements (Disjunction) Formula

A disjunction P ∨ Q is a compound statement that is true whenever at least one of its parts is true.

The Formula

P∨Q is false ⇔ P is false and Q is false

Ask yourself: Is the claim true as soon as at least one part is true?

Quick example

"I will study math OR physics tonight" is false only if I skip both subjects entirely.

Notation

P∨Q

What this formula means

A disjunction P∨Q is a compound statement that is true whenever at least one of its parts is true.

An inclusive 'or' is a room light with two switches wired in parallel: the light is on if either switch is up, and still on if both are. The room is dark only when both switches are down. An exclusive 'or' behaves like a staircase light, where flipping both switches turns it off again.

Formal view

P∨Q⇔¬(¬P∧¬Q); P∨Q=⊥ iff P=⊥ and Q=⊥

Worked examples

Example 1

easy
Let p: '2 is even' and q: '2 is odd'. Evaluate p∨q and explain the result.
Show solution

Answer

p∨q=True

First step

1.
p: '2 is even' — True. q: '2 is odd' — False.

Full solution

  1. 2.
    p∨q=T∨F=T.
  2. 3.
    In logic, p∨q (inclusive or) is true when at least one of p, q is true.
The logical OR is inclusive: it is true whenever at least one operand is true, and false only when both are false. This differs from the everyday exclusive 'or' which excludes the case where both are true.

Example 2

medium
Find all real x satisfying 'x<−1 or x>3', and express as a union of intervals.

Example 3

easy
Evaluate 'π>3 OR π<1' and identify which disjunct made it true.

Common mistakes

  • Reading logical 'or' as exclusive — P∨Q is true even when both parts are true.
  • Declaring P∨Q false because only one part is true — one true part is enough.
  • Swapping ∨ (one suffices) with ∧ (all required) — disjunction is the permissive one.

Why this formula matters

Disjunctions describe alternatives: solution sets such as ∣x∣>2 (that is, x<−2 or x>2), rules with several routes to eligibility, and case analysis in proofs, where you show that one of several cases must hold. Knowing that one true part is enough, and that both parts may be true, stops you from rejecting a true 'or' claim or misreading a rule as 'exactly one'.

Frequently asked questions

What is the Or Statements (Disjunction) formula?

A disjunction P∨Q is a compound statement that is true whenever at least one of its parts is true.

How do you use the Or Statements (Disjunction) formula?

Use a disjunction when any one condition is enough: 'or', 'either', 'at least one of', 'unless' (in logic, 'P unless Q' means P or Q). Inequalities that split into two pieces, like ∣x∣>2, are disjunctions. To prove one, show a single part true; to disprove it, show every part false. If all conditions are required, use a conjunction. If the problem says 'but not both' or 'exactly one', that is exclusive or.

What do the symbols mean in the Or Statements (Disjunction) formula?

P∨Q

Why is the Or Statements (Disjunction) formula important in Math?

Disjunctions describe alternatives: solution sets such as ∣x∣>2 (that is, x<−2 or x>2), rules with several routes to eligibility, and case analysis in proofs, where you show that one of several cases must hold. Knowing that one true part is enough, and that both parts may be true, stops you from rejecting a true 'or' claim or misreading a rule as 'exactly one'.

What do students get wrong about Or Statements (Disjunction)?

The procedure for disjunction is the easy part; the trap is reading logical 'or' as exclusive. Asking "Is the claim true as soon as at least one part is true?" first is what keeps a correct-looking calculation from being attached to the wrong concept.

What should I learn before the Or Statements (Disjunction) formula?

Before studying the Or Statements (Disjunction) formula, you should understand: logical statement.

The full guide

This formula is covered in depth in Conditional Statements: Converse, Inverse, Contrapositive, and Biconditional.