- #1
mr_coffee
- 1,629
- 1
This chapter is working with negations of Quantified statements.
True or False. All the occurrrences of the letter u in the title of this book are lower case. Justify your answer.
I said false, because they arn't being clear when they say "this" If even 1 book doesn't have a lowercase its false. But what is the method you would go about solving this?
I never took a negation of a non-if then statement. If its if then, its pretty easy:
~(Ax, if P(x) then Q(x)) equivlent too Ex such that P(x) and ~Q(x)
or
Ax in D, Q(x) equivlent Ex in D such that ~Q(x)
Note: A should be upside down, and E should be backwards.
THanks!
True or False. All the occurrrences of the letter u in the title of this book are lower case. Justify your answer.
I said false, because they arn't being clear when they say "this" If even 1 book doesn't have a lowercase its false. But what is the method you would go about solving this?
I never took a negation of a non-if then statement. If its if then, its pretty easy:
~(Ax, if P(x) then Q(x)) equivlent too Ex such that P(x) and ~Q(x)
or
Ax in D, Q(x) equivlent Ex in D such that ~Q(x)
Note: A should be upside down, and E should be backwards.
THanks!