Proposition /atomic statement

↳ statement that is true or false

connectives
↳
expression used to modify a statement
↳ applies to g not
unary connective → one statement e.

↳
binary connective →
applies to two statements e.
g and
or

symbols
↳ associate symbols to propositions
↳
P → Ali is
studying
choice is irrelevant but absolute
can also be iff
symbols for connectives

[
not 7
negation
and ^
conjunction
or ✓
disjunction
if ✗ then Y ✗ → 4 implication
✗ if only if Y ✗
and y equivalence
precedence of symbols : -
,
n
,
v
,
→
,

(descending
→ All propositional statements are atomic formulae
Syntactical decomposition tree of a formula
- Pn( QUR ) → 7-
(Q -
)
R

① - Pn( OUR )→ - -
(Q - R
)

- PNCQVR ) - >
(d -
)
R

I
- p OUR -
( QaR)
I ^ I
p Q R Q - R

^
Q TR
② →
'

^ r

^ -

'
A
7 V T
1 My
pa To }
R
R
 →
a formula needs to be interpreted to
give it a

truth value
→
an interpretation or valuation ✓ is a function that
assigns to every propositioned symbol P a truth value 10 1) ,

i. e v ( P) C-
{ 0, I
}
if ✓ ( P) = 1 ,
then P is called time under interpretation v
if ✓ ( P) = 0 , then P is called false under interpretation v

Truth Tables
( Assume A is a placeholder for any formula )
e.
g Negation C- )

v C- A) =

{ .

,
if
if
v1 A)
v (A)
=

=
1
0

A - A

to
 Exercise

1. Give all
interpretations under which ( Pv a) NR
>

is true

working
O a) AR

/ if / Of Of
P Q R - Pu - CPV _

I 0 V0
↑
O O O

O O I I 1 V ,

O 1 O O O O V

O I o o v ?
0
I 1 O Vu
I 0
'
l 1
I O I Vs

it ? 18 i °
it ↑ ↑ ,
%
V7
Ans) Vi ✓
> 5) V7
does
2 .
How
many interpretations
a
language with k
propositional symbols have ?

2k
Ans )
→
Tautology
↳ true for all interpretations
→
contradiction
↳ false for all interpretations
Contingency
→

↳ Neither contradiction
a
,
nor a
Tautology
→
logical equivalency
↳ if two formulae are same for all interpretations
' '
we use =

e.
g (A → B) = (→ AN B)
( A B) =
(A → B) n ( B →
A)
Using Logic to solve Puzzles

A = P (R ( on R) )
B =
0 ( (P n R) → ( ( IRR )
- → P) )
C = R to ( PVR))

Truth table next

page
A = P (R ( or R) )
B =
0 ( (P n R) → ( ( on R )
- → P) )
C = R to ( PVR))

B n c

t.tt
P Q R A B C A n

0 O O O

O O I I

I 0 0

I 0 1

i ↑ i ↑ ? I 1 I 1