@bettydlgc,
typos are dangerous when doing logic
Quote:
DeMogans goes as follows.
~(P v Q) may replace or be replaced by ~P & ~Q
~(P & Q) may replace or be replaced by ~P v ~Q
So whenever you want to use DeMorgans law, you have to exchange the ampersand with the wedge or the wedge with the ampersand, negate each side of of the ampersand or wedge, and negate the formula as a whole
So the correct replacement should have been:
-(-P v -Q, )therefore -P & -Q
the stated rules are correct and his verbal explication also makes sense, but I don't see how he concludes that -(-P v -Q), therefore -P&-Q is the right replacement, following your own procedure(I use ~ instead of - because it's clearer):
1)exchange wedge with ampersand ~(~P v ~Q) -> ~(~P & ~Q)
2)negate each side of the ampersand -> ~(~~P & ~~Q)
3)negate the formula as a whole -> ~~(~~P & ~~Q)
the double negations cancel and you have (P & Q)
[of course saying that the double negations cancel is not enough for a complete PROOF which is what the OP was originally asking for]
[because demorgans law is a replacement rule you wouldn't show 1) and 2) in your proof, that is just the procedure for replacement]
so after 3) you would have to simplify in steps
4)~~P & ~~Q
5)~~P
6)P
7)~~Q & ~~P
8)~~Q
9)Q
finally conjoin 6) and 9) into
10) P & Q
(this replaces by taking the right side of the demorgans law and replacing it with the left, which in this case is rather unwieldy; to go from left to right in the relation rule, which is cleaner, see jknilinux's proof, note where he writes "~(~P*~Q) will give you ~~P*~~Q, not P*Q", he must have meant "~(~Pv~Q) will give you ~~P*~~Q, not P*Q"