Loading in 5 sec....

Normal or Canonical FormsPowerPoint Presentation

Normal or Canonical Forms

- By
**naiya** - Follow User

- 258 Views
- Updated On :

Normal or Canonical Forms. Rosen 1.2 (exercises). - Disjunction - Conjunction - Negation - Implication p q p q - Exclusive or (p q) ( p q) - Biconditional p q (p q) ( q p) (p q) (q p) .

Related searches for Normal or Canonical Forms

Download Presentation
## PowerPoint Slideshow about 'Normal or Canonical Forms' - naiya

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

### Normal or Canonical Forms

Rosen 1.2 (exercises)

- Conjunction

- Negation

- Implication pq p q

- Exclusive or (p q) (p q)

- Biconditional p q

(pq) (qp)

(p q) (q p)

Logical OperatorsDo we need all these?

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(pq))and (p q) equivalent?

(p(pq))

- p (pq) DeMorgan
- p (pq) DeMorgan
- p (pq) Double Negation
- (pp)(p q) Distribution
- (pp)(p q) Commutative
- F (p q) And Contradiction
- (p q) F Commutative
- (p q) Identity

Are (p(pq))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 pq is

(pq)(pq).

- each minterm appears only once

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 Ú q)®Ør

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

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 (pqr) (pqr) (pqr) (pqr) (pqr)

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)

(pq ) DeMorgan

Find an expression equivalent to p qthat uses onlyconjunctions and negations.

p q p q

T T T

T F F

F T T

F F T

How many minterms in the DNF?

The DNF of p q is (pq) (p q) (p q).

Then, applying DeMorgan’s Law, we get that this is equivalent to

[(pq) (p q) (p q)].

Now can we write an equivalent statement to p q that uses only disjunctions and negations?

pq

[(pq) (p q) (p q)] From Before

- [(pq) (pq) (p q)] DeMorgan
- [(pq) (pq) (pq)] Doub. Neg.
- [(pq) (pq) (pq)] DeMorgan

Download Presentation

Connecting to Server..