You are on page 1of 5

Equivalents are two or more compound statements that have the same truth value.

• Two sentences are called equivalent (logically) if and only if both have the same truth value for
all substitutions for the truth value of each constituent sentence.
• If p and q are equivalent sentences, then p º q is written. If pºq then qºp too.
Two or more compound statements that have the same truth value are called logical equivalents
with the notation "two compound statements are said to be equivalent, if both compound
statements have the same truth value for all possible truth values of their component statements.

When approves of a logical equivalent that is logical ???


1. If two proposition logic is Tautology (T and T in the Truth Table).
2. If two proposition logic is Contradiction (F and F on the Truth Table).
3. In Contingent if the order T and F or otherwise in the Truth Table remain in the same order.

Logical Equivalences using conditionals and bi-conditionals

Some basic established logical equivalences are tabulated


Example :

1. Show that
-(p→q) ≡ p Λ –q

-(p→q) ≡ -(-p V q) (Using first equivalence of Condition)

≡ -(-p) Λ –q (Using D Morgan)

≡ p Λ –q (Using Double negation law)

2. Show that
–(p V (-p Λ q)) ≡ -p Λ -q

–(p V (-p Λ q)) ≡ -p Λ –(-p Λ q) (Using De Morgan’s law)


≡ -p Λ (-(-p) V –q) (Using De Morgan’s law)
≡ -p Λ (p V –q) (Using Double Negative law)
≡ -(-p V q) V (-p Λ –q) (Using Distributive law)
≡ F V (-p Λ –q) (Using Negation law)
≡ -p Λ –q (Using Identity law)
3. Show that
pΛT≡p

p T pΛT
T T T
F T F
4. Show that
(p Λ –q) V q) ≡ p V q

(p Λ –q) V q) ≡ q V ( p Λ –q) (Using Commutative law)


≡ (q V p) Λ ( q V –q) (Using Distributive law)
≡ (q V p) Λ T (Using Negation law)
≡ (q V p) (Using Identity law)
≡ (p V q) (Using Commutative law)

Converse, Contrapositive, and Inverse

 The converse of the conditional statement is “If Q then P.”

To form the converse of the conditional statement, interchange the hypothesis and the
conclusion.
 The inverse of the conditional statement is “If not P then not Q.”
To form the inverse of the conditional statement, take the negation of both the hypothesis
and the conclusion.

 The contrapositive of the conditional statement is “If not Q then not P.”
To form the contrapositive of the conditional statement, interchange the hypothesis and
the conclusion of the inverse statement.

The truth value of Converse, inverse, and contrapositive

Example:

1. p : Today is Sunday

q : It is a holiday

Converse = If it is a holiday, then today is Sunday.

Inverse = If today is not Sunday, then it is not a holiday.

Contrapositive = If it is not a holiday, then today is not Sunday.

2. p : 5x – 1 = 9

q:x=2

Implication = If 5x – 1 = 9, then x = 2
Converse = If x = 2, then 5x – 1 = 9.

Inverse = If 5x – 1 ≠ 9, then x ≠ 2.

Contrapositive = If x ≠ 2, then 5x – 1 ≠ 9.

3. p : He stays

q : I will go

Implication = If he stays, then I will go

Converse = If I will go, then he stays.

Inverse = If he does not stay, then I will not go.

Contrapositive = If I will not go, then he does not stay.

4. p= I will dance

q : You sing

Converse = If you sing, then I will dance.

Inverse = If I will not dance, then you do not sing.

Contrapositive = If you do not sing, then I will not dance.

You might also like