Unfamiliar symbol in algorithm: what does ∀ mean? [closed]

I'm reading about an algorithm (it's a path-finding algorithm based on A*), and it contains a mathematical symbol I'm unfamiliar with: ∀

Here is the context:

v(s) ≥ g(s) = min_s'∈pred(s)(v(s') + c(s', s)) ∀s ≠ s_start

Can someone explain the meaning of ∀?

Solution 1:

That's the "forall" (for all) symbol, as seen in Wikipedia's table of mathematical symbols or the Unicode forall character (\u2200, ∀).

Solution 2:

The upside-down A symbol is the universal quantifier from predicate logic. (Also see the more complete discussion of the first-order predicate calculus.) As others noted, it means that the stated assertions holds "for all instances" of the given variable (here, s). You'll soon run into its sibling, the backwards capital E, which is the existential quantifier, meaning "there exists at least one" of the given variable conforming to the related assertion.

If you're interested in logic, you might enjoy the book Logic and Databases: The Roots of Relational Theory by C.J. Date. There are several chapters covering these quantifiers and their logical implications. You don't have to be working with databases to benefit from this book's coverage of logic.

Solution 3:

In math, ∀ means FOR ALL.

Unicode character (\u2200, ∀).

Solution 4:

Can be read, "For all s such that s does not equal s[start]"