0
Add your answer:
Earn +20 pts
Make a truth table for the statement if p then not q?
. p . . . . . q. 0 . . . . . 1. 1 . . . . . 0
What is the truth table for p or q and the opposite of p and q?
P . . Q . . (P or Q)0 . . 0 . . . 00 . . 1 . . . 11 . . 0 . . . 11 . . 1 . . . 1=================P . . Q . . NOT(P and Q)0 . . 0 . . . . 10 . . 1 . . . . 11 . . 0 . . . . 11 . . 1 . . . . 0
How do you construct a truth table for p arrow q and p arrow -q. Also do truth tables differ depending on the statement?
Statements mean nothing to the validity of truth tables. However p and q must be statements - something that can be declared true or false. Example: a statement could be "There are clouds in the sky over my head right now." A statement could not be "A cloudy day is dreary" -- that is subjective (maybe true to you but not necessarily to me). That said the truth tables look at comparing all possible combinations of truth values for both statements: p could be true and q could be true, or p could be true and q could be false, or p could be false and q could be true, or p could be false and q could be false. Then you can look at the if p then q (p arrow q) truth values. Consider the If-then statements most teens hear: If you clean your room, then you can take the car out on Friday. The Parent is considered lying if they don't let you take the car out even though you cleaned your room. If you don't clean your room, the "then" part of the conditional statement does not matter -- logically then if p is not true, the conditional is considered true regardless of the value of q. table looks like p | q | p -> q T | T | T (you clean your room and you do get to take the car on Friday) T | F | F (you clean your room and you don't get to take the car on Friday) F | T | T (you don't clean your room - the rest doesn't matter) F | F | T The table for p begets not q is almost the same. Start with the same two first columns, add a column for not q (~q); then add a column to evaluate the conditional. Only this time your parent said something like "If you fail your Geometry quiz, then you can NOT go to the party on Saturday". They only lied to you if you failed your quiz and they still let you go to the party.
If p q and q r then p r. Converse statement B.A syllogism C.Contrapositive statement D.Inverse statement?
Converse: If p r then p q and q rContrapositive: If not p r then not (p q and q r) = If not p r then not p q or not q r Inverse: If not p q and q r then not p r = If not p q or not q r then not p r
What is is called when a conditional and its converse are true and they are written as a single true statement?
It is an if and only if (often shortened to iff) is usually written as p <=> q. This is also known as Equivalence. If you have a conditional p => q and it's converse q => p we can then connect them with an & we have: p => q & q => p. So, in essence, Equivalence is just a shortened version of p => q & q => p .
Construct a truth table for p and q if and only if not q?
Construct a truth table for ~q (p q)
what is the correct truth table for p V -q?
what is the correct truth table for p V~ q
what is the correct truth table for -p-> -q?
A+
Make a truth table for the statement if p then not q?
. p . . . . . q. 0 . . . . . 1. 1 . . . . . 0
What is the proof of the modus ponens not by the truth table?
1)p->q 2)not p or q 3)p 4)not p and p or q 5)contrudiction or q 6)q
What is the truth table for negation p or negation q?
P Q (/P or /Q) T T F T F T F T T F F T
What is the truth table for p or q and the opposite of p and q?
P . . Q . . (P or Q)0 . . 0 . . . 00 . . 1 . . . 11 . . 0 . . . 11 . . 1 . . . 1=================P . . Q . . NOT(P and Q)0 . . 0 . . . . 10 . . 1 . . . . 11 . . 0 . . . . 11 . . 1 . . . . 0
P-q and q-p are logically equivalent prove?
p --> q and q --> p are not equivalent p --> q and q --> (not)p are equivalent The truth table shows this. pq p --> q q -->(not)p f f t t f t t t t f f f t t t t
Where p and q are statements p and q is called what of p and q?
The truth values.
How do you construct a truth table for p arrow q and p arrow -q. Also do truth tables differ depending on the statement?
Statements mean nothing to the validity of truth tables. However p and q must be statements - something that can be declared true or false. Example: a statement could be "There are clouds in the sky over my head right now." A statement could not be "A cloudy day is dreary" -- that is subjective (maybe true to you but not necessarily to me). That said the truth tables look at comparing all possible combinations of truth values for both statements: p could be true and q could be true, or p could be true and q could be false, or p could be false and q could be true, or p could be false and q could be false. Then you can look at the if p then q (p arrow q) truth values. Consider the If-then statements most teens hear: If you clean your room, then you can take the car out on Friday. The Parent is considered lying if they don't let you take the car out even though you cleaned your room. If you don't clean your room, the "then" part of the conditional statement does not matter -- logically then if p is not true, the conditional is considered true regardless of the value of q. table looks like p | q | p -> q T | T | T (you clean your room and you do get to take the car on Friday) T | F | F (you clean your room and you don't get to take the car on Friday) F | T | T (you don't clean your room - the rest doesn't matter) F | F | T The table for p begets not q is almost the same. Start with the same two first columns, add a column for not q (~q); then add a column to evaluate the conditional. Only this time your parent said something like "If you fail your Geometry quiz, then you can NOT go to the party on Saturday". They only lied to you if you failed your quiz and they still let you go to the party.
What does the statement p arrow q mean?
It means the statement P implies Q.
How do you construct a truth table for q arrow p?
I guess you mean q → p (as in the logic operator: q implies p).To create this truth table, you run over all truth values for q and p (that is whether each statement is True or False) and calculate the value of the operator. You can use True/False, T/F, 1/0, √/X, etc as long as you are consistent for the symbol used for True and the symbol used for False (the first 3 suggestions given are the usual ones used).For implies:if you have a true statement, then it can only imply a true statement to be truebut a negative statement can imply either a true statement or a false one to be truegiving:. q . . p . q→p--------------. 0 . . 0 . . 1 .. 0 . . 1 . . 1 .. 1 . . 0 . . 0 .. 1 . . 1 . . 1 .
