|
|||||
MTH001
Elementary Mathematics
LECTURE
#2
Truth
Tables for:
~p∧q
1.
~
p ∧
(q
∨
~
r)
2.
(p∨q) ∧
~
(p∧q)
3.
Truth
table for the statement
form ~
p ∧
q
~p∧q
p
q
~p
T
T
F
F
T
F
F
F
F
T
T
T
F
F
T
F
Truth
table for ~ p ∧
(q ∨ ~ r)
q∨~r
~
p ∧
(q
∨
~
r)
~
p
q
r
~p
r
T
T
T
F
T
F
F
T
T
F
T
T
F
F
T
F
T
F
F
F
F
T
F
F
T
T
F
F
F
T
T
F
T
T
T
F
T
F
T
T
T
T
F
F
T
F
F
T
F
F
F
F
T
T
T
T
Truth
table for (p∨q) ∧
~
(p∧q)
p∨q
p∧q
~
(p∧q)
(p∨q) ∧
~
(p∧q)
p
q
T
T
T
T
F
F
T
F
T
F
T
T
F
T
T
F
T
T
F
F
F
F
T
F
Double
Negative Property ~(~p) º p
Page
6
MTH001
Elementary Mathematics
p
~p
~(~p)
T
F
T
F
T
F
Example
"It
is not true that I am not
happy"
Solution:
Let
p
= "I am
happy"
then
~ p
= "I am not
happy"
and
~(~ p) = "It is
not true that I am not
happy"
Since
~(~p)
≡
p
Hence
the given statement is
equivalent to:
"I am
happy"
~(p∧q)
and ~p ∧
~q
are not logically
equivalent
p∧q
~(p∧q)
~p
∧
~q
p
q
~p
~q
T
T
F
F
T
F
F
T
F
F
T
F
T
F
F
T
T
F
F
T
F
Different
Futh values inTow 2
and row 3 T
F
tr
T
F
T
r
DE
MORGAN'S LAWS:
1)The
negation of an and
statement is
logically equivalent to the
or
statement
in which each component is
negated.
Symbolically
~(p ∧
q) ≡ ~p ∨
~q.
2)The
negation of an or
statement is
logically equivalent to the
and
statement
in which each component is
negated.
Symbolically:
~(p ∨
q) ≡ ~p ∧
~q.
~(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
Same
truth valuTs
T
e
Application:
Give
negations for each of the
following statements:
a.The
fan is slow or
it is very
hot.
b.Akram
is unfit and
Saleem is
injured.
Solution
a.The
fan is not
slow
and
it is not
very
hot.
b.Akram
is not
unfit
or
Saleem is
not
injured.
INEQUALITIES
AND DEMORGAN'S LAWS:
Use
DeMorgan's Laws to write the
negation of
-1
< x
≤ 4
Page
7
MTH001
Elementary Mathematics
for
some particular real no.
x
-1
< x
≤ 4 means
x
> 1
and
x
≤ 4
By
DeMorgan's Law, the negation
is:
x
> 1 or
x
≤ 4Which is
equivalent to: x
≤ 1 or x > 4
EXERCISE:
1.
(p ∧
q) ∧ r ≡
p ∧(q
∧
r)
2.
Are the statements (p∧q)∨r and p
∧
(q ∨ r) logically
equivalent?
TAUTOLOGY:
A
tautology is a statement form
that is always true
regardless of the
truth
values
of the statement
variables.
A
tautology is represented by the
symbol "t"..
EXAMPLE:
The
statement form p ∨
~ p is
tautology
p∨~p
p
~p
T
F
T
F
T
T
p
∨
~p ≡ t
Page
8
Table of Contents:
|
|||||