Scribd
Upload
9 views26 pages

Lecture-7 Normal Forms

The document covers the fundamentals of logic, focusing on normal forms, particularly Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF). It explains logical operators, their functional completeness, and methods to construct DNF using truth tables. Additionally, it discusses the Boolean satisfiability problem and its significance in logic.

Uploaded by

pathakashutoshdmr1234
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
9 views26 pages

Lecture-7 Normal Forms

The document covers the fundamentals of logic, focusing on normal forms, particularly Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF). It explains logical operators, their functional completeness, and methods to construct DNF using truth tables. Additionally, it discusses the Boolean satisfiability problem and its significance in logic.

Uploaded by

pathakashutoshdmr1234
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 26

The Fundamentals of Logic

Normal Forms
Lecture-7
09-09-2020
Topic covered
1. Introduction to FoLT (Completed)
2. What are Logic- Propositional (Completed)
3. Types of operators for Logic (Completed)
4. Fuzzy Logic(Completed)
5. Propositional Equivalences(Completed)
6. Predicates and Quantifiers (Completed)
7. Rules of Inference (Completed)
8. Introduction to proofs (Completed)
9. Normal forms

2
Induction
Revision on Proofs
Normal Forms
Logical Operators

 - Disjunction Do we need all these?


 - Conjunction
 - Negation
 - Implication pq  p  q
 - Exclusive or (p  q)  (p  q)
 - Biconditional p  q 
(pq)  (qp) 
(p  q)  (q  p)
Functionally Complete
• A set of logical operators is called functionally
complete if every compound proposition is
logically equivalent to a compound
proposition involving only this set of logical
operators.
• , , and  form a functionally complete set of
operators.
Are (p(pq))
and (p  q) equivalent?
(p(pq))
 p  (pq) DeMorgan
p  (pq) DeMorgan
p  (pq) Double Negation
(pp)(p q) Distribution
(pp)(p q) Commutative
F (p q) And Contradiction
 (p q)  F Commutative
 (p q) Identity
Are (p(pq))
and (p  q) equivalent?
• Even though both are expressed with only , ,
and , it is still hard to tell without doing a
proof.
• What we need is a unique representation of a
compound proposition that uses , , and .
• This unique representation is called the
Disjunctive Normal Form.
Disjunctive Normal Form
• A disjunction of conjunctions where every
variable or its negation is represented once in
each conjunction (a minterm)
– each minterm appears only once
Example: DNF of pq is
(pq)(pq).
Truth Table

p q pq (pq)  (pq)


T T F F
T F T T
F T T T
F F F F
Method to construct DNF
• Construct a truth table for the proposition.
• Use the rows of the truth table where the
proposition is True to construct minterms
– If the variable is true, use the propositional
variable in the minterm
– If a variable is false, use the negation of the
variable in the minterm
• Connect the minterms with ’s.
How to find the DNF of (p
p q r
q)r
(p q)r (p q)r
T T T T F F
T T F T T T
T F T T F F
T F F T T T
F T T T F F
F T F T T T
F F T F F T
F F F F T T
There are five sets of input that make the statement
true. Therefore there are five minterms.
p q r (p q)r (p q)r
T T T T F F
T T F T T T
T F T T F F
T F F T T T
F T T T F F
F T F T T T
F F T F F T
F F F F T T
From the truth table we can set up the DNF
(p q)r  (pqr)  (pqr)  (pqr)  (pqr) 
(pqr)
Can we show that just  and  form a set of
functionally complete operands?

It is sufficient to show that p q can be written in


terms of  and . Then using DNF, we can write
every compound proposition in terms of  and .

(p  q)
 (p  q) Double negation (2)
 (pq ) DeMorgan
Find an expression equivalent to p  q
that uses only conjunctions and negations.

p q pq
How many minterms in
T T T the DNF?
T F F
F T T
F F T
The DNF of p  q is (pq)  (p q)  (p q).
Then, applying DeMorgan’s Law, we get that this is
equivalent to
[(pq)  (p q)  (p q)].
Now can we write an equivalent statement to p  q
that uses only disjunctions and negations?

pq
 [(pq)  (p q)  (p q)] From Before
 [(pq)  (pq)  (p  q)] DeMorgan
 [(pq)  (pq)  (pq)] Doub. Neg.
 [(pq)  (pq)  (pq)] DeMorgan
Conjunctive Normal Form
Conjunctive Normal Form
The conjunctive normal form of a proposition is
another “canonical form” that may occasionally be
useful, but not to the same degree as the
disjunctive normal form. As the name should
suggests after our discussion above, the conjunctive
normal form of a proposition is the equivalent form
that consists of a “conjunction of disjunctions.” It is
easily constructed indirectly using disjunctive
normal forms by observing that if you negate a
disjunctive normal form you get a conjunctive
normal form. For example,
Practice Problems
Solution 1.2a
Hard Practice Problem
• You can also use a truth table to see if your
solution is equivelant
SAT
• Boolean Satisfiability Problem
– Satisfiable : If the Boolean variables can be
assigned values such that the formula turns out to
be TRUE, then we say that the formula is
satisfiable.
– Unsatisfiable : If it is not possible to assign such
values, then we say that the formula is
unsatisfiable.
• Boolean satisfiability problem is NP-complete
2SAT
– Input :
– Output : The given expression is satisfiable. (for x1 =
FALSE, x2 = TRUE)
– Input :
– Output : The given expression is unsatisfiable. (for all
possible combinations of x1 and x2)
Hardness

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy