I've seen statements of the type $\forall x \in X, P(x)$ and also $P(x) \forall x \in X$.
Is there any logical difference?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this communityI've seen statements of the type $\forall x \in X, P(x)$ and also $P(x) \forall x \in X$.
Is there any logical difference?
The answer to your question depends on what you mean by "logical difference." If I observed a professor scribble something on the board akin to "$x$ is $P$, $\forall x \in \mathbb{R}$," then I would make no distinction between the meaning of such a statement and that of "$\forall x \in \mathbb{R}$, $x$ is $P$" because the scope of the quantifier is clear and I understand the professor is more interested in communicating a point than expressing a syntactically correct statement in the language of a formal system. With that being said, it is indeed true that $Px\forall x$ is not a well-formed formula in the language of first order logic (FOL).
Every formal system such as FOL contains a set of rules known as the syntax, or grammar, of the system. These rules define which strings of symbols are and are not well-formed formulas of the system's language. The syntax of FOL dictates that a quantifier, either $\forall$ or $\exists$, together with its accompanying variable $x$, always appear before the formula that is within its scope. Thus, the syntax of FOL allows for strings such as $\forall x Px$, but it does not produce strings such as $Px \forall x$.
In natural language, however, there is much more flexibility in how statements are worded. One can certainly say "for every $x$, $x$ is $P$" or "$x$ is $P$ for every $x$," and the meaning will be clear to the listener. But such levels of flexibility are typically not tolerated in formal systems because the idea is to keep the language precise, unambiguous, and efficient, leaving no room for confusion.