00:01
Alright, so now complete the following truth table.
00:04
Correct.
00:05
So now here this is the truth table given to us.
00:09
Right now, this is basically the representation of negation of p.
00:18
Right.
00:19
So we will solve this problem.
00:21
Okay.
00:21
So this is so simple abcd is given to us.
00:25
A b c d e f g h.
00:33
So here we just need to answer with t or f.
00:39
T or f means t is true, f is false.
00:44
Right.
00:44
So negation of p here is what? it should be negation of p would be this would be f f f f other than t it will be f f f then t t t.
01:01
Right.
01:02
Negation which is not like which is not true.
01:05
That should be false for sure.
01:07
Because this logic based on only binary thing.
01:11
Right.
01:12
So that is why this becomes so simple.
01:15
Now negation of p and this is the representation and right and this is the representation for negation.
01:27
Right.
01:27
So this is the logical part you have to understand.
01:30
So now here p is negation of p is f.
01:33
So whenever in and right in and if either of them is like any of them is false that means the result would be what false itself for sure.
01:50
So for for and for and logic all all the values should be true.
01:59
Right...