Rigorous Reasoning

Concept · Foundations

Universal Quantifier

The quantifier ∀x, read 'for all x,' which claims that the formula it binds holds for every object in the domain.

Why it matters

Universal quantification is how predicate logic expresses claims of the form 'every S is P' without the distribution machinery of categorical logic.

Where this shows up

Units and lessons using this concept

Following the links will take you to the page where this term is introduced in context.

Related

Other concepts in Foundations

A, E, I, O PropositionsAccessibility RelationArgumentAtomic StatementAuthorial IntentBase RateBayes FactorBurden of Proof in InterpretationCalibrationCardinalityCartesian ProductCategorical Proposition