Professional Documents
Culture Documents
MTS102 - Discrete Structures (Discrete Mathematics) 2021: Applications of Propositional Logic Logical Equivalence
MTS102 - Discrete Structures (Discrete Mathematics) 2021: Applications of Propositional Logic Logical Equivalence
MTS102 - Discrete Structures (Discrete Mathematics) 2021: Applications of Propositional Logic Logical Equivalence
Lecture-2
¬(p ∨ q)
Faheem Mahmood
• Let p = I go to Harry’s
• q = I go to the country.
• r = I will go shopping.
• If p or q then not r
(p ∨ q) → ¬ r
Faheem Mahmood
• a only if c or not f
a → (c ∨ ¬ f ).
Faheem Mahmood
Exercise
• Let p and q be the propositions “The election is decided”
and “The votes have been counted,” respectively. Express
each of these compound propositions as an English
sentence.
Faheem Mahmood
System Specifications
• System and Software engineers take requirements in
English and express them in a precise specification
language based on logic.
Consistency
1. 2. 3.
Reasoning
• An assignment of truth values that makes all three
specifications true must have p false to make true.
• Because we want to be true but must be false, q must be
true.
• Because is true when is false and is true
• we conclude that these specifications are consistent
• Let us do it with truth table now
Faheem Mahmood
1. 2. 3.
Faheem Mahmood
1. 2. 3.
4.
Inconsistent
Faheem Mahmood
Propositional Equivalence
• An important type of step used in a mathematical
argument is the replacement of a statement with another
statement with the same truth value
p ¬p p∨ ¬p p∧ ¬p
T F T F
F T T F
Logical Equivalence
• Compound propositions that have the same truth values
in all possible cases are called logically equivalent.
Logical Equivalence
p q pq p q ¬p q ¬p
T T T T T F T
T F F T F F F
F T T F T T T
F F T F F T T
Faheem Mahmood
Logical Equivalence
• Converse
The proposition q → p is converse of p → q.
• Contrapositive
The contrapositive of p → q is the proposition ¬ q → ¬
p.
• Inverse
The proposition ¬ p → ¬ q is called the inverse of p →
q.
Faheem Mahmood
Logical Equivalence
Logical Equivalence
Equivalence Name
p∧T≡p Identity laws
p∨F≡p
p∨T≡T Domination laws
p∧F≡F
p∨p≡p Idempotent laws
p∧p≡p
¬ ( ¬ p) ≡ p Double negation law
p∨q≡q∨p Commutative laws
p∧q≡q∧p
(p ∨ q) ∨ r ≡ p ∨ (q ∨ r) Associative laws
(p ∧ q) ∧ r ≡ p ∧ (q ∧ r)
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) Distribution Laws
p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
Faheem Mahmood
Logical Equivalence
• Distributive: p (q r) (p q) (p r)
p q r q r p (q r) (p q) (p r) (p q) (p
r)
T T T T T T T T
T T F F T T T T
T F T F T T T T
T F F F T T T T
F T T T T T T T
F T F F F T F F
F F T F F F T F
F F F F F F F F
Faheem Mahmood
Logical Equivalence
Equivalence Name
¬ (p ∧ q) ≡ ¬ p ∨ ¬ q De Morgan’s laws
¬ (p ∨ q) ≡ ¬ p ∧ ¬ q
p ∨ (p ∧ q) ≡ p Absorption laws
p ∧ (p ∨ q) ≡ p
p∨¬p≡T Negation laws
p∧¬p≡F
Faheem Mahmood
(p q) q
º (p q) q DeMorgan’s
º (p q) qDouble negation
º p (q q)Associative
º p q Idempotent
•
Faheem Mahmood
Proof:
(p q) q
º (p q) q Implication
º ( p q) q De Morgan
º p ( q q) Associative
º p T Negation
º T Dominations
Faheem Mahmood
[p (p q)] q
[p (p q)] q Substitution for
[(p p) (p q)] q Distributive
[ F (p q)] q Negation
(p q) q Identity
(p q) q Substitution for
(p q) q DeMorgan’s
p (q q ) Associative
p T Negation
T Domination
Faheem Mahmood
Chapter Reading
• Chapter 1, Kenneth H. Rosen, Discrete Mathematics and
Its Applications, Section 1.2,1.3
Faheem Mahmood