tired escarp
"Proofing the distributive law tautology problem in Chapter 1-p1- sec 3 slide 46. You are expected to construct a truth table made of 8 columns to show the logically equivalencies in this law. (Pick one law out of two )"
My head is genuinely hurting trying to understand this, I really don't know what to put down and its due tonight
stone turretBOT
sick sonnet
"Proofing the distributive law tautology problem in Chapter 1-p1- sec 3 slide 46...
Do you know what a truth table is and how to make it
tired escarp
Do you know what a truth table is and how to make it
I know what a truth table is but
forming it is different
sick sonnet
oh im not sure on if i did this question channel thing right?
Yeah you did it right
sick sonnet
Have u tried looking it up? I can explain it but watching a video or reading a texy will be better to get an initial understanding
sick sonnet
Ite if you need more help you can ping me
sick sonnet
i thought P would be T T F F why does she have T T T T F?
You need 8 rows to get every possible combination
Also known as 2^3
If you have n statements you need 2^n rows. It doesn’t matter how you order them as long as you get every possible combination
But we do not do 4 rows (T T F F) because we have 3 statements, if we had 2 then that would be right
sick sonnet
If you are planning to add more rows then it is good so far
If ur not you need to account for the fact P may be false
sick sonnet
Your table is missing the possibility of P Q and R being false
If you look up examples theres a pattern u can follow
So for P you will need F F F F, for Q, T T F F, and for R, T F T F
tired escarp
my work says i need 8 columns actually
do you have any idea on what the other columns could be @sick sonnet
sick sonnet
do you have any idea on what the other columns could be <@280588750373912576>
The ones you already wrote
sick sonnet
how is P all false?
I was adding onto your image
