# Bounded Quantifiers in Logic

Logical quantifiers are often bounded like $\forall x\in S: P(x)$. That is, we say that universally or existentially quantified elements satisfy a predicate (like being a member of some set) before stating the condition to be fulfilled. We describe such logical sentences here.