View Single Post
  #7  
Old 07-06-2009, 11:56 AM
Kuan's Avatar
Kuan Kuan is online now
unband
 
Join Date: Jan 2001
Location: At the Birkebeiner
Posts: 3,894
Here is how you do it. First you have these rules.

P -> Q is false only once, when P is True and Q is false.

P & Q is true only once, when both P and Q are true.

P v Q is false only once, when both P and Q are false, or, only one variable needs to be true in order for the statement to be true.

P <-> Q is true only when both P, Q, have the same values. ie., when P and Q are True then the <-> is true.

So first, fill in underneath your P, Q, and R, your given values. So

Code:
(p → ~p) V r

T      F    T
Then you fill in the values for the operators -> and v.

So

p -> ~p is false, so fill in F under the conditional arrow.

Code:
(p → ~p) V r

T      F    T

   F
r is true, so as per the rule, that a disjunction only needs one variable true to be true, fill in T underneath the v sign.

Code:
(p → ~p) V r

T      F    T

   F

          T
So the statement is True.
__________________
You don't need a weatherman to know which way the wind blows - Robert A. Zimmerman

Last edited by Kuan; 07-06-2009 at 12:01 PM.
Reply With Quote