Truth Table Analysis: P1, P2, P3

Click For Summary
SUMMARY

The discussion focuses on deriving the Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF) from a specified truth table involving three variables: P1, P2, and P3. The truth table shows various combinations of truth values and their corresponding output. The DNF is constructed by summing the fundamental row products where the output is true, while the CNF is formed by multiplying the fundamental row sums where the output is false. Specific examples illustrate the process for clarity.

PREREQUISITES
  • Understanding of Boolean algebra
  • Familiarity with truth tables
  • Knowledge of logical operators (AND, OR, NOT)
  • Ability to manipulate logical expressions
NEXT STEPS
  • Learn how to construct truth tables for complex logical expressions
  • Study the process of converting Boolean expressions to DNF and CNF
  • Explore applications of DNF and CNF in digital circuit design
  • Investigate simplification techniques for Boolean expressions
USEFUL FOR

Students of computer science, electrical engineers, and anyone involved in logic design or Boolean algebra who seeks to understand the conversion of truth tables into standard forms.

XodoX
Messages
195
Reaction score
0
Hi, I got the following truth table...


P1 P2 P3 P(P1,P2,P3)

T T T T
T T F T
T F T F
F T T F
T F F T
F T F T
F F T F
F F F T


I need the conjunctive and disjunctive normal form for this truth table. I have no idea how to do this simple problem:frown: I hope somebody can help me!
 
Physics news on Phys.org
Disjunctive Normal Form (DNF) is the sum of all fundamental row products for which the value is 1.

Conjunction Normal Form (CNF) is the product of all fundamental row sums for which the value is 0.

e.g.

\begin{array}{c|c|c} p &amp; q &amp; pq&#039; + p&#039;q \\<br /> \hline<br /> 1 &amp; 1 &amp; 0 \\<br /> 1 &amp; 0 &amp; 1 \\<br /> 0 &amp; 1 &amp; 1 \\<br /> 0 &amp; 0 &amp; 0<br /> \end{array}

DNF = pq' + p'q

CNF = (p + q)(p' + q')

I hope this is making sense. Now try it with your table.

--Elucidus
 
No..sorry, doesn't make much sense to me. DNF would be T and CNF would be F, right?
No idea, ugh.
 
XodoX said:
No..sorry, doesn't make much sense to me. DNF would be T and CNF would be F, right?
No idea, ugh.

DNF and CNF are expressions. For example (truth tables omitted)

Given p \leftrightarrow q

The DNF is the expression pq + p'q' and the CNF is the expression (p + q')(p' + q).

You can prove (using truth tables among other things) that for any Boolean expression, it is equivalent to both its DNF and CNF.

--Elucidus
 
XodoX said:
Hi, I got the following truth table...


P1 P2 P3 P(P1,P2,P3)

T T T T
T T F T
T F T F
F T T F
T F F T
F T F T
F F T F
F F F T


I need the conjunctive and disjunctive normal form for this truth table. I have no idea how to do this simple problem:frown: I hope somebody can help me!

(1) Consider the lines where P(P1,P2,P3) has the value T.
For example the second line: P1=T, P2=T, P3=F
From these values you form the conjunctive term (P1 \wedge P2 \wedge \neg \bar{P3})
Here, only P3 is negated because P3=F.

(2) For each line where P(P1,P2,P3) has the value T form the
corresponding conjunctive term.

(3) To finally get your DNF form the disjunction of all the conjunctive terms from (2).
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 17 ·
Replies
17
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K