Quiz 3
Registry Synced

Quantifier Manipulation

50 words
1 min read

Quantifier Manipulation

Swapping Quantifiers

  • ∀x∃yP(x,y)\forall x \exists y P(x,y) is NOT equivalent to ∃y∀xP(x,y)\exists y \forall x P(x,y)
  • ∀x∀yP(x,y)≡∀y∀xP(x,y)\forall x \forall y P(x,y) \equiv \forall y \forall x P(x,y)
  • ∃x∃yP(x,y)≡∃y∃xP(x,y)\exists x \exists y P(x,y) \equiv \exists y \exists x P(x,y) Join Discord PreviousPredicate LogicNextProof Techniques
Document outline

Keep your place and jump directly to a heading.

Table of contents

No note selected

Open a chapter to see its outline, backlinks, and sources here.

Open libraryCheckpoint desk