The document contains examples of logical statements and proofs involving propositional logic and quantifiers. Specifically:
1. It provides examples of common logical rules and forms such as modus ponens, modus tollens, hypothetical syllogism, and others.
2. It demonstrates evaluating the truth values of compound propositional statements.
3. It introduces basic quantifier concepts like domain of discourse and shows examples of quantified statements with universal and existential quantifiers like "For all x" and "There exists an x".
20. P 4 -9
T T F
~
T F T
F T F
F F T
1
F I
,
T 1
-(p " q) WC-P h--q)
kPl1s1akPl1s1a
P 4 -P -gP 4 -P -q P v9P v9 i(P vq)i(P vq) -P A -9-P A -9 -(p vq) w c-p A -q)-(p vq) w c-p A -q)
T TT T FF FF TT FF FF TT
T FT F FF TT TT FF PP TT
F TF T TT FF TT FF FF TT
F FF F TT TT FF TT TT TT
70 SC 101
26. P
T
T
F
F
-
-
9
-
T
F
T
F
-
-
P
-
-q
-
F
T
F
T
‘34 -(P =+I) -PA-q (p 3q) a-p A-q:
Y
i%hhlkiis"uns (tautology) ikh%lJ~~li
(1) [p A(p 3 q)l 3 q
(2) [(p =aq)h-qla-p
(3) [!p *q) A cq 3 r)l 3 (p -;sr)
(4) [(P vq) A-ql=+p
(5) [[(p-q) A (i--s)1 A (p VI-11 3 (q v s)
(Modus Ponens)
(Modus Tollens)
(Hypothetical Syllogism)
(Dls]uncti.we Sylloqism)
(Constructive Dllemma)
(6) [[(p=sn)A(r3511 A&q v-s)]*(+p"- 1-1 (DestructiveDilemma)
(7) (P *q) a (-q--p) (Contrapositlve)
(8) (p A q) 9 p (Simplification)
7 6
SC 101
27. Cp*q) A (PA -q) 1
[ (p*q) Aiq=>r)l*[-(p=>r)
-
TTT T F
TTF 7 F
T FT F T
T F F F F
F T T T F
FTF T T
F’FTT T F
F F F T F
SC 101
.
7 7
28.
29.
30.
31.
32. 1 . Modus Ponens
2. Modus Tollens
in? Pa9
-s
He-i -p
3. Hypothetical Syllogism
SC 101
33. 4. Disjunctive Syllogism
-2
WIJ P
5. Constructive Dilemma
x-35
6. Destructive Dilemma
-9 v - s
RB -p v - r
' 7. Contrapositive
lyl P-q
RA -cl=+-P
8. Substraction (simplification)
8 3
34. d v e
-d
. -
. . f
W'Ejd
1 . d V e
2.1s v d
3. -d
4. e
RA -p
G$u’
1. ,-(p A - q)
2. -P v - C-q)
3. -P v 9
4 . q=;s-r
2, 3 disjunctive sylloqism
nTcruw%w"
4.5 Modus Ponens
8 4 SC! 101
36. - P
1.
c 49
c
24
(u A g) *s
-,S
-(u A g)
-u v - g
8. u3-g
9. P3U
.lO p&-g. .
11. grg-P
2.8 -GbmFhi~ (Quantifier)
1-y 5)
1,2 Modus Ponens
LM? 3)
rwg 4)
4,5 M o d u s Tollens
6. m-pihE
7, fi+ja
rlwj 2 )
9, 8 Hypothetical Syllogism
10, contrapositive
11, 3 Modus Ponens
#
8 6 SC 101
37. Vxip(x)l = P(a) A P (b) A P Cc) / .__
3x[p(xll = P(a)" P(b) " P(c) v _._
SC 101 8 7
44. 1.1
1.2
1.3
1.4
1.5
1.6
1.7
1.8
1.9
1.10
(P / r) Q (q v s)
-r v -s
-(p A r) 3 c-q fi p)
[P A (q ,v t11 w s
(par) v -(r*s)
(r as) 3 (p v - p)
[[p + (q v’ r)l A - sl 3 t
-P V P
- P A P
(P Aq)*P
9 4 SC 101
45. 3 . 3 (p-q) 3 (-P V 'i)
3 . 4 (q j p:1 A (p A -q)
(p rq) =+I
4.1 F
4 . 2 P *(q*r)
T
4 . 3 (p A q) * (r v s)
F
4 . 4 c-p v (q Ar) =sP
F
4 . 5 (p vq) =+(r. AS)
F
4 . 6 (p 3 r) A (q * 1^)
T
4 . 7 (p v - q) 3 (I- A (p A Cl
F
4 . 8 p =G-(q =+r)
T
5. b~a4lnln-ml~~duaa 13, q, r
))
5.1 p 3 (q v r)
F
5 . 2 p A (q Vr)
F
5 . 3 (p A 9:' * r
F
5.4 [ (p A Cl) d rl 3 ( --I 3 -P)
F
5 . 5 [(p A q) 3 rl V [p 3 (q +r)l
F
SC 101 95
46. 7.1
7.2
7.3
7.4
7.5
7.6
7.7
7-a
7.9
7 . 1 0
- P *P
(p A q) ==a-p
P A - P
[ (p * q) A PI *q
I (P ‘“g)l 3 [(p 3 q) A (4 3 P)l
[(P =.+q) A -sl =a-P
tp A (q v r)l 3 (p A q) v (p fi r)
(p* q) -c-q q-p)
-(p V q) W.-p A -q
UllJd&Fl 2 . 5
1. ;~S~l~rulsil~st:ws~~~n~or~~~bi~OnYU
1.1 Pvq ; 4 V P
1.2 pv(qAr) ; (P vq) A r
1.3 p A (q A r) ; (p A q) A r
1.4 pV(qhr) i (p v q) A (p V r)
1.5 p A (q V r) ; (p A q) v (p A r)
1.6 PAq ; pa-q
1.7 PAP ; P
1.8 PVP ; P
1.9 Peg ; (P =3 q) A (q ==a p)
1.10 p-q ; -p v q
9 6 SC 101
47. 1.11 -(pVg) ; - P Aq
1.I2 -(p A sq) * ; -p A-9
1.13 -(pvq) ; -P A--9
1.14 -(pAq) ; -P v - q
1.15 (- p) P
2. (P v q) ==+ (P A q)
3. P A - P
4. (p =a ‘~1 H (q 3 P)
5. c-p v 9) =+ (P 3 q)
SC 101 9 7
48. 6. q 3 [P A (P 3 s)l
7. [p * (q A r)ler (p 3 q) A (P 3 r)l
a. I (p =>q) A (- q)l jp
9. PV-P
1.1
1.2
1.3
1.4
1.5
9 8
SC 101