Logic / Logic 263 · Atom · ~20 seconds
The Pairing Rule
Video not yet published
to the StudyWalks catalog
to the StudyWalks catalog
State
Universal quantifiers take ⊃; existential quantifiers take ·.
Show
(x)(Sx · Px) says everything is both S and P — far too strong. (∃x)(Sx ⊃ Px) is true if anything at all fails to be S — far too weak.
Watch for
Both mispairings produce well-formed nonsense: grammatical, meaningful, and never what you meant.