MAT 203 Discrete Mathematical Structures

LBSITW

Sajith P

September 30, 2020

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 1 / 92

 Important Connectives Conjunction

Module 1

Mathematical logic:Basic connectives and truth table. Statements Logical

Connectives Tautology Contradiction.Logical Equivalence: The Laws of
Logic, The principle of duality- Substitution Rules The implication-The
Contrapositive- the Converse the Inverse. Logical Implication - Rules of
Inference, The use of Quantifiers: Open Statement- Quantifier- Logically
Equivalent Contrapositive Converse Inverse , Logical equivalences and
implications for quantified statement- implications ,negation ( 9 hours)

Text :Discrete and Combinatoral Mathematics (An Applied Introduction),

Ralph P Girimaldi, B V Ramana , 5th Edition, Pearson

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 2 / 92

 Important Connectives Conjunction

Statements or Proposition

A declarative sentence that is either true or false is called a proposition or

a statement.
A proposition has two possible values called truth values.
The two truth values are true and false.
They are denoted by T and F.
These values are also denoted by 1 and 0.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 3 / 92

 Important Connectives Conjunction

Statements -Examples

Example
1 4+7=9
2 Thiruvananthapuram is the capital of Kerala.
3 The integer 5 is a prime number.
4 The sun rises in the East
The truth value of (1) is false and the truth values of (2), (3) and (4) are
true.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 4 / 92

 Important Connectives Conjunction

Statements -Examples

No. Statement Truth Value

1 India is a country True
2 Kollam is the capital of Kerala False
3 3 + 4 = 10 False

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 5 / 92

 Important Connectives Conjunction

Statements -Examples

The following are not propositions.

1 What time is it?
2 Go out and play.
3 Open the door. (command)
4 x+4=7. (x is unknown)
5 Nehru was a great Prime Minister of India. (comparison)

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 6 / 92

 Important Connectives Conjunction

Statement variable

Simple propositions are represented by letters p, q, r , . . ..

These letters are known as propositional variables or statement variables.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 7 / 92

 Important Connectives Conjunction

Compound Statements

Two or more simple propositions can be combined to form a new

proposition.
The new proposition thus formed is called compound proposition.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 8 / 92

 Important Connectives Conjunction

Conjuction

Let p and q be two propositions.

The conjunction of p and q is denoted by p ∧ q. It is read as p and q.
The conjunction is formed by combining the propositions using the
connective ‘and’.
p ∧ q has a truth value T whenever both p and q have a truth value T.
In all other cases it has a truth value F. The truth table for p ∧ q is shown
in the Table

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 9 / 92

 Important Connectives Conjunction

Conjuction-Truth Table

p q p∧q
T T T
T F F
F T F
F F F
Table: Table for (p ∧ q)

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 10 / 92

 Important Connectives Conjunction

Conjuction-Examples

Example
1 p : I am rich.
q : I am happy.
p ∧ q : I am rich and happy.
2 p : I will drive my car.
q : I will be late.
p ∧ q : I will drive my car and I will be late.
3 p: 2 is an even integer.
q: 4 is an even integer.
p ∧ q : 2 is an even integer and 4 is an even integer.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 11 / 92

 Important Connectives Conjunction

Disjuction

Let p and q be two propositions. The disjunction of p and q is denoted by

p ∨ q. It is read as p or q.
The disjunction is formed by combining the propositions using the
connective ‘or’.
p ∨ q has a truth value F whenever both p and q have a truth value F.
In all other cases it has a truth value T.
The truth table for p ∨ q is shown in the Table 2.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 12 / 92

 Important Connectives Conjunction

Disjuction-Truth Table

p q p∨q
T T T
T F T
F T T
F F F
Table: Table for (p ∨ q)

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 13 / 92

 Important Connectives Conjunction

Disjunction-Example

Example
1 p : I am rich.
q : I am happy.
p ∨ q : I am rich or happy.
2 p : I will drive my car.
q : I will be late.
p ∨ q : I will drive my car or I will be late.
3 p: 2 is an even integer.
q: 4 is an even integer.
p ∨ q: 2 is an even integer or 4 is an even integer.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 14 / 92

 Important Connectives Conjunction

Negation

Let p be a proposition. The negation of p is not the case of p. It is

denoted by ∼ p or ¬p. It is read as negation of p. The truth table for ¬p
is shown in the Table 3.

p ¬p
T F
F T
Table: Table for (¬p)

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 15 / 92

 Important Connectives Conjunction

Negation -Example

Example
1 p : I am rich.
¬p : I am not rich.
Or
¬p : It is not the case that I am rich.
2 p : I will drive my car.
¬p : I will not drive my car.
Or
¬p : It is not the case that I will drive my car.
3 p : 2+7>7
¬p :2 + 7 ≤ 7.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 16 / 92

 Important Connectives Conjunction

Implication

Let p and q be two propositions. p and q can be combined to form ‘if p

then q’. Such a statement is called implication.
The implication of p and q is denoted by p → q.
It is read as ‘p implies q’.
p → q has a truth value F when p has a truth value T and q has a truth
value F. In other cases it has a truth value T.
The truth table for p → q is shown in the Table 4.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 17 / 92

 Important Connectives Conjunction

Implication- Truth Table

p q p→q
T T T
T F F
F T T
F F T
Table: Table for (p → q)

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 18 / 92

 Important Connectives Conjunction

Implication-examples

Example
1 p : I am rich.
q : I am happy.
p → q : If I am rich then I am happy.
2 p : I will drive my car.
q : I will be late.
p → q :If I drive my car then I will be late.
3 p: 2 is an even integer.
q: 4 is an even integer.
p → q: If 2 is an even integer then 4 is an even integer.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 19 / 92

 Important Connectives Conjunction

Implication

The statement p → q can be read in one of the following ways:

If p, then q
If p, q
p implies q
p only if q
q if p
p is sufficient for q
p is sufficient condtion for q
q is necessary for p
q is necessary condtion for p
q follows from p
q unless ¬p

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 20 / 92

 Important Connectives Conjunction

Bicondtional

Two propositions p and q can be combined using the connective ‘if and
only if’. The statement thus formed is called biconditional statement. It is
writern as p ↔ q
The statement p ↔ q is true if both p and q have the same truth value.
In all other cases it has a truth value F.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 21 / 92

 Important Connectives Conjunction

Statements

p q p↔q
T T T
T F F
F T F
F F T
Table: The truth table for p ↔ q

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 22 / 92

 Important Connectives Conjunction

Bicondtional

Example
1 p : I am happy.
q : I am rich.
p ↔ q :I am happy if and only if I am rich.
2 p : I will drive my car.
q : I will be late.
p ↔ q : I will drive my car if and only if I will be late.
3 p: 2 is an even integer.
q: 4 is an even integer.
p ↔ q: 2 is an even integer if and only if 4 is an even integer.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 23 / 92

 Important Connectives Conjunction

Problem

Example
Determine whether each of the following sentences is a statement.
1 In 2003 George W. Bush was the president of the United States.
2 x+3 is a positive integer.
3 Fifteen is an even integer.
4 If Jennifer is late for the party, then her cousin Zachary will be quite
angry.
5 What time is it?

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 24 / 92

 Important Connectives Conjunction

Solution

Solution:
1 This sentence is a statement.
2 This sentence is not a statement.
3 This sentence is a statement.
4 This sentence is a statement.
5 This sentence is not a statement.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 25 / 92

 Important Connectives Conjunction

Problem

Example
If p, q be premitive statementsfor which the implications p → q is false.
Determine the truth values for each of the following.
(a) p ∧ q (b) ¬p ∨ q (c) q → p (d) ¬p → ¬q

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 26 / 92

 Important Connectives Conjunction

Solution

p → q has a truth value F when p has a truth value T and q has a truth
value F.
1 p ∧ q has a truth value F.
2 ¬p ∨ q has a truth value F.
3 q→p has a truth value T.
4 ¬p → ¬q has a truth value F.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 27 / 92

 Important Connectives Conjunction

Solution

Example
Let p, q, r , s denote the following statements

p: I finish writing my computer program before lunch.

q: I shall play tennis in the afternoon.
r: The sun is shinning.
s : The humidity is low.

Write the following in symbolic forms

1 If the sun is shining, I shall play tennis this afternoon.
2 Finishing the writting of my computer program before lunch is
necessary for my playing tennis this afternoon.
3 Low humidity and sun shine are sufficient for me to play tennis this
afternoon.
Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 28 / 92
 Important Connectives Conjunction

Solution

Solution
1 r → q

2 q→p
3 (s ∧ r ) → q

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 29 / 92

 Tautology

Tautology

A compound statement which is always true, regardless of the truth value

of its components, is called a tautology.
Example
p ∨ ¬p is a tautology.

p ¬p p ∨ ¬p
T F T
F T T
Table: Truth table for p ∨ ¬p

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 30 / 92

 Tautology

Problem

Example
Let p, q, r , s denote the following statements

p: Triangle ABC is isosceles.

q: Triangle ABC is equilateral.
r: Triangle ABC is equiangular.

Translate each the following into an English sentence.

(a) q → p (b) ¬p → ¬q (c) q ↔ r
(d) p ∧ ¬q (e) r → p

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 31 / 92

 Tautology

Solution

Solution
(a) If traingle ABC is equilateral then it is isosceles.
(b) If traingle ABC is not isosceles then it is not equilateral.
(c) The traingle ABC is equilateral if and only if it is equiangular.
(d) If traingle ABC is isosceles and it is not equilateral.
(e) If traingle ABC is equiangular then it is isosceles.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 32 / 92

 Tautology

Problem

Example
Rewrite each of the following statements in an implication in the if-then
form.
1 Practicing her serve daily is a sufficient condtion for Darci to have a
good chance of winning the tennis tournament.
2 Mary will be allowed on Larry’s motorcycle only if she wears her
helmet.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 33 / 92

 Tautology

Solution

Solution
1 If Darci Practices her serve daily then she will have a good chance of

winning the tennis tournament.

2 If Mary is to be allowed on Larry’s motorcycle then she must wear her
helmet.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 34 / 92

 Tautology

Problem

Example
Assuming p is true, q is false and r is true, find the truth value of each of
the following
1 (p ∧ q) → r
2 (p ∨ q) → r
3 p ∧ (q → r )
4 p → (q → r )

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 35 / 92

 Tautology

Solution

Solution
p = T, q = F, r = T

1 (p ∧ q) → r
Since p is true and q is false p ∧ q is false, r is true. Therefore
(p ∧ q) → r is true.
2 (p ∨ q) has a truth value T, r has a truth value F. So (p ∨ q) → r is
false.
3 q → r has a truth value T and p has a truth value T. So p ∧ (q → r )
is true.
4 q → r has a truth value T. So p → (q → r ) has a truth value .

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 36 / 92

 Tautology

Problem

Example
Assuming p and r are false and that of q and s are true, find the truth
value of the each of the following propositions:
1 (s → (p ∧ ¬r )) ∧ (p → (r ∨ q)) ∧ s
2 ((p ∧ ¬q) → (q ∧ r )) → (s ∨ ¬q)

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 37 / 92

 Tautology

Solution

Solution
p = F, r = F, q = T, s = t

1 ¬r is true.
(p ∧ ¬r ) has a truth value F.
s → (p ∧ ¬r ) has a truth value F. Therefore the given expression
(s → (p ∧ ¬r )) ∧ (p → (r ∨ q)) ∧ s has the truth value F.
2 (p ∧ ¬q) has a truth value F.
q ∧ r has a truth value F.
(p ∧ ¬q) → (q ∧ r ) is True.
s ∨ ¬q) has a truth value F.
So the expression ((p ∧ ¬q) → (q ∧ r )) → (s ∨ ¬q) has the truth
value T.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 38 / 92

 Tautology

Problem

Example
p: It is below freezing point,
q: It is snowing.
What are the following statements in symbolic form?
(a) It is below freezing point and snowing.
(b) It is not below freezing point and it is not snowing.
(c) It is either snowing or below freezing point.
(d) ‘It is below freezing point’ is the necessary and sufficient condition for
it to be snowing.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 39 / 92

 Tautology

Solution

Solution
(a) p∧q
(b) ¬p ∧ ¬q
(c) p∨q
(d) p→q

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 40 / 92

 Tautology

Problem

Example
Formulate the following symbolic expressions in words using
p: Today is Monday.
q: It is raining.
r : It is hot.
(a) p∨q
(b) ¬p ∧ (q ∨ r )
(c) ¬(p ∨ q) ∧ r

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 41 / 92

 Tautology

Solution

Solution
(a) Today is Monday or it is raining.
(b) Today is not Monday and either it is raining or it is hot.
(c) It is hot and it is not the case that today is Monday or it is raining.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 42 / 92

 Tautology

Problem

Example
p: It is below freezing point.
q: It is snowing.
What ate the following statements in symbolic form?
label=((a) It is below freezing point and snowing.
lbbel=((b) It is not below freezing point and it is not snowing.
lcbel=((c) It is either snowing or below freezing point.
ldbel=((d) ‘It is below freezing point’ is the necessary and sufficient condition for
it to be snowing.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 43 / 92

 Tautology

Solution

Solution
(a) p∧q
(b) ¬p ∧ ¬q
(c) p∨q
(d) p→q

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 44 / 92

 Tautology

Solution

Example
Formulate the following symbolic expressions in words using
p: Today is Monday.
q: It is raining.
r : It is hot.
(a) p∨q
(b) ¬p ∧ (q ∨ r )
(c) ¬(p ∨ q) ∧ r

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 45 / 92

 Tautology

Solution

Solution
(a) Today is Monday or it is raining.
(b) Today is not Monday and either it is raining or it is hot.
(c) It is hot and it is not the case that today is Monday or it is raining.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 46 / 92

 Tautology

Tautology-Problem

Example
Indicate which ones are tautologies or contradiction:
(a) (p → ¬q) → ¬p
(b) p → (p ∨ q)
(c) p → (q → p)

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 47 / 92

 Tautology

Contradiction

A compound statement which is always false, regardless of the truth values

of its components, is called a contradiction.
Example
p ∧ ¬p is a contradiction.

p ¬p p ∧ ¬p
T F F
F T F
Table: The truth table for p ∧ ¬p

(p ∧ q) ∧ q is always false. So p ∧ ¬p is a contradiction.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 48 / 92

 Tautology

Tautology

Example
(¬q ∧ p) ∧ q is a contradiction

p q ¬q ¬q ∧ p (¬q ∧ p) ∧ q
T T F F F
T F T T F
F T F F F
F F T F F
Table: The truth table for (¬q ∧ p) ∧ q

(¬q ∧ p) ∧ q is always false. So (¬q ∧ p) ∧ q is a contradiction.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 49 / 92

 Tautology

Exclusive OR

Let p and q be any two statement formulas. Then p and q can be

combined using the connective exclusive OR. This is denoted by p Y q. It
has a truth value T whenever either p or q but not both have a truth value
T.

p q pYq
T T F
T F T
F T T
F F F
Table: The truth table for p Y q

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 50 / 92

 Tautology

NAND and NOR

NAND
The connective NAND is a combination of NOT and AND. Here NOT is
for negation and AND is for conjunction. It is denoted by ↑.

p ↑ q = ¬(p ∧ q)

NOR
NOR is the combination of NOT and OR. It is denoted by ↓

p ↓ q = ¬(p ∨ q)

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 51 / 92

 Tautology

Problems

Example
If statement q has a truth value 1, determine all truth value assignment
for the premitive statements p, r and s for which the truth value of the
statement
(q → [(¬p ∨ r ) ∧ ¬s]) ∧ [¬s → (¬r ∧ q)]
is 1.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 52 / 92

 Tautology

Solution

Solution
Given
Truth value of q is 1 and
(q → [(¬p ∨ r ) ∧ ¬s]) ∧ [¬s → (¬r ∧ q)] is 1.
So the truth value of (q → [(¬p ∨ r ) ∧ ¬s]) is 1 and
[¬s → (¬r ∧ q)] is 1.
So the truth value of (q → [(¬p ∨ r ) ∧ ¬s] is 1 implies [(¬p ∨ r ) ∧ ¬s] has
a truth value 1
[(¬p ∨ r ) ∧ ¬s] has a truth value 1 implies
(¬p ∨ r ) has a truth value 1 and ¬s have a truth value 1.
¬s have a truth value 1 implies s has a truth value 0.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 53 / 92

 Tautology

Solution Cont ...

Solution
[¬s → (¬r ∧ q)] has a truth value 1 implies
((¬r ∧ q) has a truth value 1
Therefore ¬r has a truth value 1.
so the truth value of r is 0.
(¬p ∨ r ) has a truth value 1 and r has a truth value 0 implies
¬p has a truth value 1.
So the truth value pf p is 0.
So the truth value of primitive variables p is 0, r is 0 and s is 0.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 54 / 92

 Tautology

Problem

Example
Construct truth tables for each of the following compound statements and
check which of the compound statements are tautologies, where p, q, r
denote primitive variables.
1 ¬(p ∨ ¬q) → ¬p
2 p → (q → r )
3 (p → q) → r
4 (p → q) → (q → p)
5 [p ∧ (p → q)] → q
6 (p ∧ q) → p
7 q ↔ (¬p ∨ ¬q)
8 [(p → q) ∧ (q → r )] → [(p → r )

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 55 / 92

 Tautology

Problems

Example
Determine all truth value assignments if any for the primitive statements
p, q, r , s, t that makes each ofthe following component statement false.

1 [(p ∧ q) ∧ r ] → (s ∨ t)
2 [p ∧ (q ∨ r )] → (s Y t).

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 56 / 92

 Tautology

Solution
1 [(p ∧ q) ∧ r ] → (s ∨ t) has a truth value F.

p → q has a truth value F when p has a truth value T and q has a

truth value F .
So [(p ∧ q) ∧ r ] has a truth value T and (s ∨ t) has a truth value F .
[(p ∧ q) ∧ r ] has a truth value T implies truth value of
p = q = r = T.
(s ∨ t) has a truth value F implies truth value of s = t = F .

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 57 / 92

 Tautology

Problems

Solution
1 [p ∧ (q ∧ r )] → (s Y t) has a truth value F.

[p ∧ (q ∧ r )] has a truth value T and s Y t) has a truth value F .

[p ∧ (q ∧ r )] has a truth value T implies truth value of
p = q = r = T.
(s Y t) has a truth value F implies both s and t has same truth value.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 58 / 92

 Tautology

Logical Equivalance

Let s1 and s2 be two statement formulas.

Ifs1 and s2 have the same truth value for every possible set of truth values
of its components, then s1 and s2 are said to be equivalent.
If s1 and s2 are equivalent, then s1 → s2 is a tautology.
s1 is equivalent to s2 is denoted by s1 ⇔ s2 .

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 59 / 92

 Tautology

Logical Equivalance

Example
¬(p ∨ q) ⇔ ¬p ∧ ¬q
¬(p ∨ q) and ¬p ∧ ¬q have the same truth value.
so ¬(p ∨ q) ⇔ ¬p ∧ ¬q

p q ¬p ¬q p∨q ¬(p ∨ q) ¬p ∧ ¬q
T T F F T F F
T F F T T F F
F T T F T F F
F F T T F T T
Table: Truth table for ¬(p ∨ q) ⇔ ¬p ∧ ¬q

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 60 / 92

 Tautology

Logical Equivalance
Equivalent formulas:
1 Idempotent Laws

p∨p ⇔p
p∧p ⇔p
2 Associate laws
(p ∨ q) ∨ r ⇔ p ∨ (q ∨ r )
(p ∧ q) ∧ r ⇔ p ∧ (q ∧ r )
3 Commutative laws
p∨q ⇔q∨p
p∧q ⇔q∧p
4 Distributive laws
p ∨ (q ∧ r ) ⇔ (p ∨ q) ∧ (p ∨ r )
p ∧ (q ∨ r ) ⇔ (p ∧ q) ∨ (p ∧ r )
5 Absorption laws
p ∨ F ⇔ p, p ∧ F ⇔ F
p ∨ T ⇔ T, p ∧ T ⇔ p
6 Demorgan’s laws
¬(p ∨ q) ⇔ ¬p ∧ ¬q
¬(p ∧ q) ⇔ ¬p ∨MAT
Sajith P ¬q203 Discrete Mathematical Structures September 30, 2020 61 / 92
 Tautology

Logical Equivalance

Example
Show that p ∧ (¬q ∨ r ) and p ∨ (q ∧ ¬r ) are logically not equivalent.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 62 / 92

 Tautology

Logical Equivalance

Let s1 = p ∧ (¬q ∨ r ) and s2 = p ∨ (q ∧ ¬r ) We have to prove that the

truth values of s1 and s2 are not same

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 63 / 92

 Tautology

Logical Equivalance

p q r ¬p (¬q ∨ r ) s1 ¬r (q ∧ ¬r ) s2
0 0 0 1 1 0 1 0 0
0 0 1 1 1 0 0 0 0
0 1 0 0 0 0 1 1 1
0 1 1 0 1 0 0 0 0
1 0 0 1 1 1 1 1 1
1 0 1 1 1 1 0 0 1
1 1 0 0 0 0 1 1 1
1 1 1 0 1 1 0 0 1

Fom the table it is clear that s1 and s2 donot have the same truth value.
s1 and s2 are not logically equivalent.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 64 / 92

 Tautology

Logical Equivalance

Example
Prove p → q ⇔ ¬p ∨ q

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 65 / 92

 Tautology

Logical Equivalance

Solution
p q ¬p p→q (¬p ∨ q)
0 0 1 1 1
0 1 1 1 1
1 0 0 0 0
1 1 0 1 1

Fom the table it is clear that p → q and ¬p ∨ r have the same truth value.
p → q and ¬p ∨ r are logically equivalent.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 66 / 92

 Tautology

Logical Equivalance

Conclusion
The negation of the conjuction of two premitive statement p, q is
equivalent to the disjunction of their negations ¬p, ¬q.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 67 / 92

 Tautology

Logical Equivalance

Conclusion
The negation of the disjunction of two premitive statement p, q is
equivalent to the conjuction of their negations ¬p, ¬q.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 68 / 92

 The principal Duality

Logical Equivalance

Let s be a statement. Let s contains logical connective ∨ and ∧ only.

Then the dual of s is denoted by s d . It is obtained from s by replacing
each occurence of ∧ by ∨ and ∨ by ∧ and each occurrence of T0 and F0
by F0 and T0 respectively.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 69 / 92

 The principal Duality

Duality

Dual of a primitive statement is the same primitive statement.

If p is primitive then p d = p and (¬p)d = ¬p

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 70 / 92

 The principal Duality

Duality

Let s and t be statements that contain no logical connectives other than

∨ and ∧ . If s ⇔ t, then s d ⇔ t d .

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 71 / 92

 The principal Duality

Duality

Let p, q denote primitive statement. Use truth table to verify the following
logical equivalence
1 p → (q ∧ r ) ⇔ (p → q) ∧ (p → r )
2 (p ∨ q) → r ⇔ (→ r ) ∧ (q → r )
3 (p → (q ∨ r ) ⇔ [¬r → (p → q]

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 72 / 92

 The principal Duality

Logical Equivalance

Problem
Negate the following statement.
If John goes to Lake George then Marry pays for John’s shopping spree

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 73 / 92

 The principal Duality

Logical Equivalance

p: John goes to lake George.

q: Marry pays for John’s shopping spree

p ↔ q ⇔ ¬p ∨ q
¬(p ↔ q) ⇔ ¬(¬p ∨ q)
⇔ ¬(¬p) ∧ ¬q
⇔ p ∧ ¬q

So the negation of the statement is

John goes to lake George and Marry does not pays for John’s shopping
spree

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 74 / 92

 The principal Duality

Logical Equivalance

Example
Use subtitution rule to verify that each of the following is a tautology.
(Here p, q, r are premitive statements.
1 [p ∨ (q ∨ r )] ∨ ¬[p ∨ (q ∨ r )]
2 [(p ∨ q) → r )] ↔ [¬r → ¬(p ∨ q)]

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 75 / 92

 The principal Duality

Logical Equivalance

Solution
1 we know that p ∨ ¬p ⇔ T
0
Replace P by [p ∨ (q ∨ r )]
[p ∨ (q ∨ r )] ∨ ¬[p ∨ (q ∨ r )] isa tautology.
2 we know that p → q ⇔ ¬q → ¬p
p → q ↔ ¬q → ¬p ⇔ T0
In p → q ⇔ ¬q → ¬p
replace p by p ∨ q and occurrence q by r we get
[(p ∨ q) → r ] ⇔ [¬r → (p ∨ q)]
[(p ∨ q) → r )] ↔ [¬r → ¬(p ∨ q)] ⇔ T0

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 76 / 92

 The principal Duality

Logical Equivalance

Example
For primitive statement p, q, r and s, simplify the compound statement
[[[(p ∧ q) ∧ r ] ∨ [(p ∧ q) ∧ ¬r ]] ∨ ¬q] → s

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 77 / 92

 The principal Duality

Logical Equivalance

Solution

[[(p ∧ q) ∧ r ] ∨ [(p ∧ q) ∧ ¬r ]] ⇔
[(p ∧ q) ∧ (r ∨ ¬r )]
[(p ∧ q) ∧ T0 ]
(p ∧ q)
[(p ∧ q) ∨ ¬q]
⇔ [(p ∨ ¬q) ∧ (q ∨ ¬q)]
⇔ [(p ∨ ¬q) ∨ T0 ]
(p ∨ ¬q)

So [[[(p ∧ q) ∧ r ] ∨ [(p ∧ q) ∧ ¬r ]] ∨ ¬q] → s ⇔ (p ∨ ¬q) → s

⇔ q → p → s.
Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 78 / 92
 The principal Duality

Negation- Problems

Example
Negate and express in each of the following statement in English.
1 Kelsey will get a good education if she put her studies before her
interest in cheerleading.
2 Norma is doing her home work and Karen is practicing her piano
lessons.
3 If Harold passes his C++ course and finishes his data structure
project then he will graduate at the end of the semester.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 79 / 92

 The principal Duality

Problems

Solution
1 p : Kelsey put her studies before her interest in cheerleading. q :

Kelsey will get a good education

The given statement is p → q

p → q ⇔ ¬p ∨ q
¬(p → q) ⇔ ¬(¬p ∨ q)
⇔ ¬(¬p) ∧ ¬q
⇔ p ∧ ¬q

So the negation of the given statement is

Kelsey will not get a good education and she put her studies before
her interest in cheerleading.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 80 / 92

 The principal Duality

Problems
1 p : Norma is doing her home work
q : Karen is practicing her piano lessons
The given statement is p ∧ q ¬(p ∧ q) ⇔ ¬p ∨ ¬q
So the negation of the given statement is
Norma is not doing her home work or Karen is not practicing her
piano lessons.
2 p Harold passes his C++ course q : Harold finishes hir data structure
project
r : Harold will graduate at the end of the semester. The given
statement is (p ∧ q) → r
(p ∧ q) → r ⇔ ¬(p ∧ q) ∨ r
¬[(p ∧ q) → r ] ⇔ ¬[¬(p ∧ q) ∨ r ]
¬¬(p ∧ q) ∧ ¬r
⇔ (p ∧ q) ∧ ¬r

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 81 / 92

 The principal Duality

Problems

So the negation of the given statement is

Harold passes his C++ course and finishes his data structure project and
he did not graduate at the end of the semester.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 82 / 92

 The principal Duality

Problem

Example
Negate each of the following and simplify the resulting statement
1 p ∧ (q ∨ r ) ∧ (¬p ∨ ¬q ∨ r )
2 (p ∧ q) → r
3 p → (¬q ∧ r )
4 p ∨ q ∨ (¬p ∧ ¬q ∧ r )

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 83 / 92

 Inverse, Converse and Contrapositive

Inverse Converse, Contrapositive

Let p and q be prepositions. Then

the inverse of p → q is ¬p → ¬q
the converse of p → q is q → p, and
the contrapositive of p → q is ¬q → ¬p.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 84 / 92

 Inverse, Converse and Contrapositive

Inverse, Converse

1 p: 4ABC is equilateral
q: 4ABC is isosceles
p → q: If 4ABC is equilateral, then it is isosceles.
Converse: q → p: If 4ABC is isosceles, then it is equilateral.
Inverse: ¬p → ¬q: If 4ABC is not equilateral, then it is not isosceles.
Contrapositive: ¬q → ¬p: If 4ABC is not isosceles, then it is not
equilateral.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 85 / 92

 Inverse, Converse and Contrapositive

Inverse Converse,Contrapositive

1 p: 2 is an even integer
q: 4 is an even integer
p → q: If 2 is an even integer then 4 is an even integer.
Converse: q → p: If 4 is an even integer then 2 is an even integer.
Inverse: ¬p → ¬q: If 2 is not an even integer then 4 is not an even
integer.
Contrapositive: ¬q → ¬p: If 4 is not an even integer, then 2 is not
an even integer.

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 86 / 92

 Inverse, Converse and Contrapositive

Converse Inverse Contrapositive

Example
Write the converse, inverse, and contrapositive of each of the following
implications. For each implications determine its truth value of the
corresponding converse, inverse and contrapositive.
1 If 0 + 0 = 0 then 1 + 1 = 1
2 If − 1 < 3 and 3 + 7 = 10 then Sin( 3π
2 ) = −1

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 87 / 92

 Inverse, Converse and Contrapositive

Converse,Inverse

Solution
1 If 0 + 0 = 0 then 1 + 1 = 1

p : 0+0=0
q :1+1=1
Implication :( p → q) : If 0 + 0 = 0 then 1 + 1 = 1
Truth valiue ; F
Converse ( q → p) : If 1 + 1 = 1 then 0 + 0 = 0
Truth valiue : T
Inverse ( ¬p → ¬q) : If 0 + 0 6= 0 then 1 + 1 6= 1
Truth valiue : T
Contrapositive ( ¬q → ¬p) : If 1 + 1 6= then 0 + 0 6= 0
Truth valiue : T

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 88 / 92

 Inverse, Converse and Contrapositive

Inverse, Converse

Solution
1 If − 1 < 3 and 3 + 7 = 10 then Sin( 3π
2 ) = −1
p : −1<3
q : 3 + 7 = 10
r : Sin( 3π
2 ) = −1
Implication: (p ∧ q) → r
If − 1 < 3 and 3 + 7 = 10 then Sin( 3π
2 ) = −1
Truth value : True
Converse : r → (p ∧ q)
If Sin( 3π2 ) = −1 then − 1 < 3 and 3 + 7 = 10
Truth value : True

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 89 / 92

 Inverse, Converse and Contrapositive

Inverse, Converse

Solution
1 Inverse: ¬(p ∧ q) → ¬r ⇔ (¬p ∨ ¬q) → ¬r

If − 1 ≥ 3 or 3 + 7 6= 10 then Sin( 3π2 ) 6= −1

Truth value : True
Contrapositive : ¬r → ¬(p ∧ q) ⇔ ¬r → (¬p ∨ ¬q)
If Sin( 3π
2 ) 6= −1 then − 1 ≥ 3 or 3 + 7 6= 10
Truth value : False

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 90 / 92

 Inverse, Converse and Contrapositive

Inverse Converse

Example
Let p, q, r denotes primitive statements. Find the form of contrapositive
of p → (q → r ) with (a) only one occurrence of the connective → (b)
no occurrence of the connective →

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 91 / 92

 Inverse, Converse and Contrapositive

Inverse Converse

Solution
Contrapositive of p → (q → r ) is ¬(q → r ) → ¬p
(a) Only one occurrence of the connective →
(q → r ) ∨ ¬p
(b) No occurrence of the connective (¬q ∨ r ) ∨ ¬p

Sajith P MAT 203 Discrete Mathematical Structures September 30, 2020 92 / 92