P :

proposition
T F

up
EPT F

F T

P,?PYf_
" "

p v2 P or R

T
T F
T T
F
F
F F

PyQ,Pf2_
"
"

pad Panda

T F F

F T F
F

-E✗ample:pmvethatcpva,%ia÷y .

pspva-P-j.IE
T

T
T

F
T

T
T

T T F T
F
F F T T
F
 up and
R is Tifandonlyif both P
not P and not .
.

and A

are F
= n ( Pv A)
v2
up a
have the
equivalent if they always
same

P and R are
> truth value .

Theorem 1
.

Let P . A. R be propositions then the following

are equivalent .

double negation law

Cal P and n( up ,

(b) PV I and QVP laws

ycommutatne
.

and Rap
cc ) pad

(d) v12 ) and ( PVR ) v12

puca
,z
) associative laws

and pay ,
,
[
)
let PA Chak

¥?YP^R^R'(P^Q),^R_ T

F F
T F
T
;
; ;
F F F F F

PAIR v12 ) and ( pad )vcpnR) distributor laws

}
if > .

( QAR )
and ( pray , ( pur,
9'
'
Pv
 P and Q R
car 12 )
or
p a
" "

is T when P is T and Ior R ist

i. e. P is T and at least one of Q and R

is T
at least one of
Pad PAR is T
when V and
i

is -1
Ipx a) vcpxk )
" "

both P and R T
ie . at least one of are

and
"

both P and R are -1

"
is T

a) and up v na
De Morgan 's laws
}
Chi n
Cpa .

and us
up
,,

lil nip v2 )

T F F
T
T T
F F F T
T
T T
F T F T F

LFFFT
determined that
suppose for
.

✗ we

Example : some integer

then its
"

and ✗ > 10
"

is not true .
negation
✗ is even

"
"
the and ✗ no is true
that
.

not case is even

it is ✗

"
even
"
is
P : ✗

2 = F
p a
" "

✗ no
Q:

nipa a) = -1
 na = T
up v

"
up odd
"

:
✗ is

"
"
✗ E lo
ud :

✗ is
odd or ✗ eco
just
.

T is
up und =

that
a denial of a proposition P is
any proposition
Definition ;

up
equivalent
is to .

Q) neither P L
"

Not P or Q
"
in
CPV nor .

cups v2

c) [ I { y

( p # nd ) auth
p n na n n
R

I a curl
[ p a cub >

Rules :

n
is
always applied to the smallest
proposition following
.
it

propositions surrounding
it
smallest
.

connecting
a. ✓ one always
used how or more times in
sequence ,
the same connective is
When
're evaluated from the left .

they
 1.2
Chapter

conditionalsenlence.PE
P and Q the
Definition ,
Given propositions ,

"

Q the
"

If P then a
is
proposition ,

the consequence
the antecedent Q is .

P
,

is called

that is true if and only it p is

false
proposition
"
"
p is
2 a

or Q is true .

pQ
T T T

:→
1¥
TF
"

Example :
"
IT =3 Paris is the capital of England (F)

Let P and Q be propositions

Definition
.

The conierse of p on is a p

The of p Q cus , cups

conium is .

to its contraposition
theorem p Q is equivalent
;
end > up >
Print :

¥¥"
"

T F
F F
T F
T T
T T F
F
T T
F T T
F

The bi conditional sentence P⇐7Q is the proposition

Definition ;

exactly when
"
P⇐> Q is true
if and only Q
"

P if .

the truth value

Q has same
.

P and

P a p⇐> a

F F T

T F F

F T F

23--8 iff 49 perfect

"

is
Eixample :
proposition : a

"

Square
.
Theorem 1.2.2 Let P . Q .
R be
propositions . then the tolling

are equivalent :

and up v2
) 2
ca
p

(b) p⇐ > 2 and cp a) ✗ ( 2 p)

cc ) a) and p and
ucp
and p v2
(d) ulpxa ) .

and Q up
let alpha )

(f) p cR R ) and ipad / R

(2×212) and ip a> ✗ cp R)

(g) p

ch ) * v2 ) R and (p R)^cQ R)