0
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 true
- but a negative statement can imply either a true statement or a false one to be true
giving:
. q . . p . q→p
--------------
. 0 . . 0 . . 1 .
. 0 . . 1 . . 1 .
. 1 . . 0 . . 0 .
. 1 . . 1 . . 1 .
Still curious? Ask our experts.
Chat with our AI personalities
Devin
Lao
ProfessorAdd your answer:
Earn +20 pts
How do you construct a truth table for parenthesis not p q parenthesis if and only if p?
Assuming that you mean not (p or q) if and only if P ~(PVQ)--> P so now construct a truth table, (just place it vertical since i cannot place it vertical through here.) P True True False False Q True False True False (PVQ) True True True False ~(PVQ) False False False True ~(PVQ)-->P True True True False if it's ~(P^Q) -->P then it's, P True True False False Q True False True False (P^Q) True False False False ~(P^Q) False True True True ~(P^Q)-->P True True False False
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 are the truth value of the sentence P v P?
True
What is the truth table for p and negation q?
P | T T F F Q | T F T F Q' | F T F T P + Q' | F T F F The layout is the best I could do with this software. Hope it is OK.
is this statement true of false if point P is not on line L, the rhombus method can be used to construct a line M that is parallel to line L through P.?
true
