Using Conjunctive Normal form to find when wff is true

  • Thread starter Thread starter member 731016
  • Start date Start date
  • Tags Tags
    Form Normal
Click For Summary
SUMMARY

The discussion focuses on understanding how to determine the truth values of propositions in Conjunctive Normal Form (CNF). Specifically, setting propositions P1 and P2 to true results in the CNF being true due to the properties of logical OR. The equation demonstrates that (true + false) evaluates to true, confirming that the overall CNF expression holds true when at least one component is true. This clarification is essential for solving problems related to CNF in propositional logic.

PREREQUISITES
  • Understanding of propositional logic
  • Familiarity with Conjunctive Normal Form (CNF)
  • Knowledge of logical operators, specifically OR (disjunction)
  • Basic skills in evaluating logical expressions
NEXT STEPS
  • Study the principles of propositional logic
  • Learn about the conversion of logical expressions to CNF
  • Explore truth tables for complex logical expressions
  • Investigate the implications of negation in logical propositions
USEFUL FOR

Students of logic, mathematicians, and anyone studying formal logic systems will benefit from this discussion, particularly those working with Conjunctive Normal Form and truth evaluations in propositional logic.

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   Reactions: member 731016

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
32
Views
3K
  • · Replies 40 ·
2
Replies
40
Views
5K
  • · Replies 5 ·
Replies
5
Views
2K