Math 2.0

concept

Order of quantifiers

Summary

In a statement with several quantifiers, the order of different quantifiers changes the meaning. For a predicate P(x,y)P(x, y), the statement ∃y ∀x P(x,y)\exists y \, \forall x \, P(x, y) implies ∀x ∃y P(x,y)\forall x \, \exists y \, P(x, y), but the converse is false in general. Two quantifiers of the same type commute: ∀x ∀y P(x,y)\forall x \, \forall y \, P(x, y) is equivalent to ∀y ∀x P(x,y)\forall y \, \forall x \, P(x, y), and the same holds for ∃\exists.

Remarks

On the integers, ∀x ∃y (y>x)\forall x \, \exists y \, (y > x) is true, but ∃y ∀x (y>x)\exists y \, \forall x \, (y > x) is false. In ∀x ∃y\forall x \, \exists y, the choice of yy can depend on xx. The definitions of continuity and of uniform continuity differ only in the order of quantifiers.

Explanations

L1 human

"Every person has a mother" is ∀x ∃y\forall x \, \exists y: each person has their own mother. "Some person is the mother of every person" is ∃y ∀x\exists y \, \forall x: one mother for all. The first sentence is true, and the second is false.

What this node needs for W2
  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 5 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Proposition concept
  2. Predicate definition
  3. Existential quantifier definition
  4. Universal quantifier definition
  5. Order of quantifiers concept

Sources

  1. Web https://en.wikipedia.org/wiki/Quantifier_(logic), lead section