00:01
For this problem, we're given a new type of logical operator called n and.
00:05
So we say that p and and q is true when either p or q or both are false, and it's false when both p and q are true.
00:15
So we have this new way of writing this p and q with this vertical line here.
00:20
So the goal of this problem is to create a truth table for this new logical operator.
00:26
So to do so, we first need to fill in columns for both p and q.
00:31
So we want to make sure that we're filling in the columns so that we get every single combination of true and false.
00:37
So one way to do that is to do true, true, false, false in the first column, and then do true, false, true, false in the second column.
00:48
And that'll give us every combination.
00:52
All right, so then filling in this truth table is going to come from this definition here.
00:57
So we know that this is going to be true when either p or q or both are false.
01:03
So that means that we're looking for places where there's at least one false...