SUNY Geneseo Department of Mathematics
Math 239 03
Spring 2021
Prof. Doug Baldwin
(The following is/are the initial prompt(s) for an online discussion; students may have posted responses, and prompts for further discussion may have been added, but these things are not shown.)
This discussion helps you become familiar with some ideas about quantifiers beyond their basic meanings. In particular, it explores statements that involve multiple quantifiers, how to negate statements with quantifiers, and how to prove quantified statements.
Try to write each of the following statements using the quantifier symbols “∃” and “∀” instead of English words. For statements that involve the word “not,” try to find two symbolic forms, one that uses the logical “not” symbol (“¬”) and one that doesn’t:
Can you describe a general strategy for proving an existentially quantified statement (i.e., a “there exists” statement). For example, how would you prove “there exists an integer greater than 10”? Does the method you used generalize to other existential statements?
How about a universally quantified statement (i.e., a “for all” statement)? For example, how would you prove “every even integer is of the form n + 2 where n is another even integer”? Does your method generalize to other universal statements?
(And as a sort of “bonus” question, how many quantifiers are there in that “every even integer is of the form n + 2 where n is another even integer” example?)