I'm reading a book by Mark Tarver called Logic, Proof and Computation.
Chapter 8 (starting p71) is about First Order Logic. On page 77 (of Chapter 8) the author writes:
For any value for 'x', in '(taller x Elton_John)' the resulting proposition is true.
In first order logic this is written
( $\forall x\;$ (taller x Elton_John))
$\forall \;$ is the universal quantifier.
Now when I studied Discrete Maths at Uni 15 years ago - the universal quantifier $\forall\;$ meant for every x.
When I look at functional programming (Lisp, Haskell etc) for all and any are two distinct concepts. In functional programming for all means (every? function elements)
and any means (some? function elements)
. That is the first applies the function to every element regardless of the result of the function, and the latter applies the function lazily, until it returns true.
My question is: Is the universal quantification symbol $\forall\;$ known as "for any x" or "for all x" in first order logic, and why is this different to discrete math?
any?
"is there any", not "for any". – Henno Brandsma May 16 '16 at 11:44