Using Conjunctive Normal form to find when wff is true

  • Thread starter Thread starter member 731016
  • Start date Start date
  • Tags Tags
    Form Normal
member 731016
Homework Statement
I am trying to understand how to tell which values for a proposition need to be taken on to make a CNF true.
Relevant Equations
CNF notation
For this,
1689831998459.png

Does someone please know how setting ##P_1## and ##P_2## true makes the CNF true? If I see ##P_2## true, then it ##(true + false)## since it is negated. Therefore, should they be setting ##P_1## true and ##P_2## false?

Many thanks!
 
Physics news on Phys.org
ChiralSuperfields said:
Homework Statement: I am trying to understand how to tell which values for a proposition need to be taken on to make a CNF true.
Relevant Equations: CNF notation

For this,
View attachment 329444
Does someone please know how setting ##P_1## and ##P_2## true makes the CNF true? If I see ##P_2## true, then it ##(true + false)## since it is negated. Therefore, should they be setting ##P_1## true and ##P_2## false?

Many thanks!
As it says, "+" specifies OR (##\vee##),
so (true + false) = (true OR false) = true.
So setting P1 and P2 true gives:
(T + F) (T + ? + ?) (T + ?)
which is (T) (T) (T)
since (True OR anything) is True
so the overall result is T.
 
  • Informative
Likes member 731016
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top