Universal Quantifier (∀)

Mathematical Logic · Axiom Academy

LESSON Universal Quantifier (∀) Understanding how to express "for all" statements in predicate logic using the universal quantifier The universal quantifier makes a claim about every single element in the domain of discourse. If even one element fails to satisfy the predicate, the entire statement is false. 2. How to Read Universal Statements Universal statements can be read in several equivalent ways. Learning these variations helps you understand mathematical texts and write clear proofs. For example, ∀x (x > 0) over positive integers reads as: "For all x, x is greater than 0" or "Every x is greater than 0" Understanding when a universal statement is true or false is crucial for working with predicate logic. The truth value depends on every element in the domain. 4. Finite Domains and Conjunction When the domain is finite, we can expand a universal statement into a conjunction (logical AND) of individual statements. This shows the connection between ∀ and ∧. Example: If domain = 1, 2, 3 , then ∀x (x² ≥ x) ≡ (1² ≥ 1) ∧ (2² ≥ 2) ∧ (3² ≥ 3) ≡ true ∧ true ∧ true ≡ true 5. Examples with Different Domains The same logical statement can have different truth values depending on the domain. Always be clear about what domain you're working with! Natural language has many ways to express universal statements. Recognizing these patterns helps you translate between English and formal logic.

This is the written version of the interactive lesson above. See the full Mathematical Logic course.