Scribd
Upload
14 views

Lecture 6

The document discusses logical equivalence of propositions and various logical equivalences between statement forms. It provides examples of logical equivalences using truth tables, such as the double negation law that the negation of the negation of a statement is logically equivalent to the statement. Various logical equivalence laws are defined, such as identity laws, domination laws, and De Morgan's laws regarding negation of conjunctions and disjunctions.

Uploaded by

Quicksilver
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

Lecture 6

The document discusses logical equivalence of propositions and various logical equivalences between statement forms. It provides examples of logical equivalences using truth tables, such as the double negation law that the negation of the negation of a statement is logically equivalent to the statement. Various logical equivalence laws are defined, such as identity laws, domination laws, and De Morgan's laws regarding negation of conjunctions and disjunctions.

Uploaded by

Quicksilver
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

LOGICAL

EQUIVALENCE Prof. Dr. Quanita Kiran


OF
PROPOSITIONS
Two statement forms are called
logically equivalent if, and only
if, they have identical truth values
for each possible substitution of
statements for their statement
variables.

The logical equivalence of


statement forms p and q is
denoted by writing p ≡ q.
Double Negation:
Construct a truth table to show that the negation of the
negation of a statement is logically equivalent to the
statement.

p ￢p ￢(￢p)
T F T
F T F

p ≡ ￢(￢p)
p →q ≡ ￢ p q

p q ￢p p →q ￢pvq
T T F T T
T F F F F
F T T T T
F F T T T
Rewrite the following statement in if-then
form.
You will pass the exam if you work
hard.
Let p = I work hard.
q = I will pass the exam.

￢p v q = I will not work hard or I will pass


the exam.

It is necessary to wash boss’s car for


promotion.
The negation of an and
statement is logically
equivalent to the or statement in
which each component is
negated.
￢(p q) ≡ ￢ p ￢ q.
D’ MORGAN
LAWS
The negation of an or statement
is logically equivalent to the
and statement in which each
component is negated.
￢(p q) ≡ ￢ p ￢ q.
Take the negation of the following statements.

1. The connector is loose or the machine is


unplugged.

2. This computer program has a logical error in


the first ten lines or it is being run with an
incomplete data set.

Assume x is a particular real number and use De


Morgan’s laws to write negations for the
statements:
 −1 < x < 5
 x ≤ −1 or x > 1
A tautology is a statement form that is always true
regardless of the truth values of the individual
statements substituted for its statement variables. A
statement whose form is a tautology is a
tautological statement.

A contradiction is a statement form that is always


false regardless of the truth values of the individual
statements substituted for its statement variables. A
statement whose form is a contradiction is a
contradictory statement.
The statement form p ￢ p is a tautology and
that the statement form p ￢ p is a contradiction.

p ￢p p ￢p p ￢p
T F T F
F T T F

If t is a tautology and c is a contradiction, show


that p t ≡ p and p c ≡ c

p t c p t p c
T T F T F
F T F F F
Equivalence Name
p t≡p Identity laws
p c≡p
p t≡t Domination laws
p c≡c
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) Distributive laws
p (q r) ≡ (p q) (p r)
￢(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 ≡ c
The negation of “if p then q” is logically equivalent to “p
and not q.”

￢(p →q) ≡ p ￢q

￢(p →q) ≡ ￢(￢ p q)


≡ ￢(￢ p) (￢ q) by De Morgan’s laws
≡p ￢q by the double negative
law.
It is tempting to write the negation of an if-then
statement as another if-then statement.

Please resist that temptation!

Exercise:

1. If P is a square, then P is a rectangle.


2. If Ali is 7 years old, then Ali is tall or he is fat.
3. If today is Monday, then tomorrow will be
Tuesday.

You might also like