9 Ninth Week Flashcards
Describe the introduction rule for the existential quantifier.
You can infer an existential generalization from any instance. For example, you can infer ∃x Fx from Fa.
Describe the elimination rule for the existential quantifier.
The basic idea behind this rule is simple. Given an existential statement (e.g. ∃x Fx) you can introduce a name for a witness (e.g. Fi). It’s important that you choose a new name — i.e. a name that doesn’t otherwise appear in the proof, or in the inference you’re trying to prove.
Sadly, the formatting for the rule is tricky!
Symbolize the statement “Some beetle has spots”.
UD: Animals
Bx: x is a beetle.
Sx: x has spots
∃x(Bx ^ Sx)
Symbolize the statement “Some beetle doesn’t have spots”.
UD: Animals
Bx: x is a beetle.
Sx: x has spots
∃x(Bx ^ ~Sx)
True or False: In this course, we insist that the domain must always be non-empty.
True.