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

When to use: At least one must be true. Logical OR is inclusive — "P or Q or both" — unlike the exclusive everyday "either/or."

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.

At least one must be true. Logical OR is inclusive — "P or Q or both" — unlike the exclusive everyday "either/or."

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.

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

Disjunction is the permissive connective and the inclusive 'or' is a frequent trap because everyday 'or' is often exclusive. A student who treats logical 'or' as exclusive (excluding 'both') will mis-fill truth tables and misjudge when a compound condition is met. Recognizing it by "Is the claim true as soon as at least one part is true?" — rather than by familiar numbers — is what lets a student tell it apart from conjunction (and) and exclusive or (xor) and union (sets) in a mixed problem set.

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?

At least one must be true. Logical OR is inclusive — "P or Q or both" — unlike the exclusive everyday "either/or."

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

P∨Q

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

Disjunction is the permissive connective and the inclusive 'or' is a frequent trap because everyday 'or' is often exclusive. A student who treats logical 'or' as exclusive (excluding 'both') will mis-fill truth tables and misjudge when a compound condition is met. Recognizing it by "Is the claim true as soon as at least one part is true?" — rather than by familiar numbers — is what lets a student tell it apart from conjunction (and) and exclusive or (xor) and union (sets) in a mixed problem set.

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.

← Back to Or Statements (Disjunction) See All Examples Practice Problems