Newbie Needs Help with CNF of Formula

  • Context: MHB 
  • Thread starter Thread starter ion88
  • Start date Start date
  • Tags Tags
    Formula
Click For Summary
SUMMARY

The discussion focuses on converting the logical formula (((A -> (B -> C)) & (A -> B)) & A) <-> C into its conjunctive normal form (CNF). The user, ion88, initially provided an incorrect CNF (¬B ∨ C) which was verified against a truth table. The correct approach involves using a Karnaugh Map to derive the CNF, resulting in the expression (A ∨ ¬C) & (B ∨ ¬C). This method effectively utilizes the distributive property of boolean expressions for conversion.

PREREQUISITES
  • Understanding of logical operators (AND, OR, NOT)
  • Familiarity with truth tables
  • Knowledge of Karnaugh Maps for simplifying boolean expressions
  • Basic concepts of conjunctive normal form (CNF)
NEXT STEPS
  • Study how to construct and interpret Karnaugh Maps
  • Learn about truth table generation for complex logical expressions
  • Explore boolean algebra and its properties for expression simplification
  • Research advanced techniques for converting logical formulas to CNF
USEFUL FOR

Students of computer science, mathematicians, and anyone involved in logic design or boolean algebra who seeks to understand the conversion of logical expressions into conjunctive normal form.

ion88
Messages
2
Reaction score
0
Hello I'm new here. Can someone please help me with the conjunctive normal form for this formula ?
(((A -> (B -> C)) & (A -> B)) & A) <-> C
I don't know if i did this right or not. If not what should i do ?
oT5LC58
 
Physics news on Phys.org

Attachments

  • mhb_inline_0001.png
    mhb_inline_0001.png
    85.4 KB · Views: 110
ion88 said:
Hello I'm new here. Can someone please help me with the conjunctive normal form for this formula ?
(((A -> (B -> C)) & (A -> B)) & A) <-> C
I don't know if i did this right or not. If not what should i do ?
Hello ion88.

This is the truth table you need to fill in:

$$\begin{array}{|c|c|c|c|c|c|c|c|}\hline A & B & C & B\to C & A\to(B\to C) & A\to B & (A\to(B\to C))\,\&\,(A\to B) & ((A\to(B\to C))\,\&\,(A\to B))\,\&\,A \\ \hline 0 & 0 & 0 \\ \hline 0 & 0 & 1 \\ \hline 0 & 1 & 0 \\ \hline 0 & 1 & 1 \\ \hline 1 & 0 & 0 \\ \hline 1 & 0 & 1 \\ \hline 1 & 1 & 0 \\ \hline 1 & 1 & 1 \\ \hline \end{array}$$

When you have done, compare the last column with the $C$ column.
 
Olinguito said:
Hello ion88.

This is the truth table you need to fill in:

$$\begin{array}{|c|c|c|c|c|c|c|c|}\hline A & B & C & B\to C & A\to(B\to C) & A\to B & (A\to(B\to C))\,\&\,(A\to B) & ((A\to(B\to C))\,\&\,(A\to B))\,\&\,A \\ \hline 0 & 0 & 0 \\ \hline 0 & 0 & 1 \\ \hline 0 & 1 & 0 \\ \hline 0 & 1 & 1 \\ \hline 1 & 0 & 0 \\ \hline 1 & 0 & 1 \\ \hline 1 & 1 & 0 \\ \hline 1 & 1 & 1 \\ \hline \end{array}$$

When you have done, compare the last column with the $C$ column.


Sory but I don't even know what programming language is that
 
ion88 said:
Sory but I don't even know what programming language is that

Hi ion88, welcome to MHB! (Wave)

No worries.
I believe you've already correctly filled in the table, which is what MarkFL uploaded for you.

I'm afraid it also means that the conjunctive normal form that you had found (¬B ∨ C), is not correct.
We can verify by checking (¬B ∨ C) against your truth table, and see that it does not match. (Worried)

The easiest way to convert your truth table to conjunctive form, is through a so called Karnaugh Map.
It looks like this:
\begin{tikzpicture}
%preamble \usepackage{karnaugh-map}
\node {
\begin{karnaugh-map}[4][2][1][AB][C]
\minterms{0,1,2,3,7}
\maxterms{4,5,6}
\implicant{0}{2}
\implicant{3}{7}
\end{karnaugh-map}
};
\end{tikzpicture}
From this Karnaugh Map, we can deduce that the corresponding disjunctive expression is:
(A & B) ∨ ¬C​
That is, the green rectangle corresponds to (A & B), and the red rectangle corresponds to ¬C.
The resulting expression is true if we are in the green rectangle OR in the red rectangle.

We can convert it to conjunctive normal form by using the distributivity of boolean expressions:
(A & B) ∨ ¬C = (A ∨ ¬C) & (B ∨ ¬C)​
(Thinking)
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K