Making a truth table is actually very simple.
For the statement P, it can either be true, or false.
P
--
T
F
NOT P, or -p (or ~p) is the opposite. If P is true, then not P is... false!
The same holds true for if P is false, what is not P? True!
The truth table for ~p looks like this
P | ~p
--------
T | F
F | T
. p . . . . . q. 0 . . . . . 1. 1 . . . . . 0
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.
Not sure I can do a table here but: P True, Q True then P -> Q True P True, Q False then P -> Q False P False, Q True then P -> Q True P False, Q False then P -> Q True It is the same as not(P) OR 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
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
Construct a truth table for ~q (p q)
. p . . . . . q. 0 . . . . . 1. 1 . . . . . 0
___p_|_t_|_f_| q__t_|_t_|_t_| ___f_|_t_|_f_|
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 .
To construct a truth table for the expression ( pq ), you start by listing all possible combinations of truth values for the variables ( p ) and ( q ). There are four combinations: ( (T, T) ), ( (T, F) ), ( (F, T) ), and ( (F, F) ). For each combination, the expression ( pq ) (which represents the logical AND) is true only when both ( p ) and ( q ) are true; otherwise, it is false. The final column of the truth table will show the results: T, F, F, F for the combinations listed.
what is the correct truth table for p V~ q
truth table gives relation between i/p & o/p. excitation table is use for design of ff & counters.
A+
The statement "if not p, then not q" always has the same truth value as the conditional "if p, then q." They are logically equivalent.
The statement formed by exchanging the hypothesis and conclusion of a conditional statement is called the "converse." For example, if the original conditional statement is "If P, then Q," its converse would be "If Q, then P." The truth of the converse is not guaranteed by the truth of the original statement.
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
The difference between the lies of P lying and the truth is that lies are intentionally false statements made to deceive, while the truth is a statement that accurately reflects reality.