Scribd
Upload
119 views21 pages

Ex 1.3 Propositional Equivalences

1. The document discusses propositional equivalences including tautologies, contradictions, and contingencies. It provides examples of each using truth tables. 2. Class activities are described to use truth tables to show that certain propositions are tautologies or contradictions. 3. Logical equivalence between propositions is defined as having the same truth values in all cases. Examples are given to show logical equivalence using truth tables and logical equivalence notation.

Uploaded by

Moiz Malik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
119 views21 pages

Ex 1.3 Propositional Equivalences

1. The document discusses propositional equivalences including tautologies, contradictions, and contingencies. It provides examples of each using truth tables. 2. Class activities are described to use truth tables to show that certain propositions are tautologies or contradictions. 3. Logical equivalence between propositions is defined as having the same truth values in all cases. Examples are given to show logical equivalence using truth tables and logical equivalence notation.

Uploaded by

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

1

CC1041
Discrete Structures

Ayesha Asmat
[email protected]
2

Sec 1.3

Propositional Equivalences
Tautology
3

● A compound proposition that is always true,


no matter what the truth values of the
propositional variables that occur in it, is
called a tautology.

● p ∨ ¬p is always true, it is a tautology.


Contradiction
4

● A compound proposition that is always false is


called a contradiction.

● p ∧ ¬p is always false, it is a contradiction.


Contingency
5

● A compound proposition that is neither a


tautology nor a contradiction is called a
contingency.

● P v ¬q
Class Activity
6

● Use truth table to show that [(p → q) ∧ p]→q


is a tautology.
● Use truth table to show that (p ∧ ~q) ∧(~p ∨
q) is a contradiction.
Logically Equivalent
7

● Compound propositions that have the same


truth values in all possible cases are called
logically equivalent.
● The compound propositions p and q are called
logically equivalent if p ↔ q is a tautology.
The notation p ≡ q denotes that p and q are
logically equivalent.
● ≡ is logically equivalent sign
Example
8

● Show that p → q and ¬p ∨ q are logically


equivalent.
Example
9
● Show that p ∨ (q ∧ r) and (p ∨ q) ∧ (p ∨ r)
are logically equivalent. This is the distributive
law of disjunction over conjunction.
Class Activity
10

● Show that ¬(p ∨ q) and ¬p ∧ ¬q are logically


equivalent.
Class Activity
11

● Show that ¬(p ∨ q) and ¬p ∧ ¬q are logically


equivalent.
12
13
14
De-Morgan Law
15
Convert using De Morgan Law
16

Use De Morgan’s laws to find the negation


● Ali is fat and wealthy
● Negation according to de Morgan law is
“Ali is not fat or not wealthy”
● Ahmed will go to Lahore or Karachi
● Negation according to de Morgan law is
“Ahmed will not go to Lahore and not go to
Karachi”
Class Activity
17

● Use De Morgan’s laws to find the negation


● Ibrahim is smart and hard working.
● Ahmed support Peshawar Zalmi or Karachi
Kings
Show that ￢ (p → q) and p ∧ ￢ q are logically
equivalent. 18
We have the following equivalences.

● ￢ (p → q) ≡ ￢ ( ￢ p ∨ q) by p → q ≡ ￢ p
∨q

● ≡ ￢ ( ￢ p)∧ ￢ q by the second De


Morgan law
● ≡p∧￢q by the double negation law
19
20
Practice Problems
21

Q: 1,5,6,7,9,16,17,22,23,24,30

You might also like