Logic in Computer Science

CHNG 5. SUY LUN T NHIN

CHNG 5.

SUY LUN T NHIN

5.1. CHNG MINH NG THC
V d 1. Chng minh rng:
Nu tt c cc tn phi gio hu (Quakers) Q(x) l nhng ngi ci lng
(Reformists) R(x) v nu c mt ngi theo o tin lnh (Protestant) P(x) ngi l
mt tn phi gio hu (Quakers) Q(x), th phi c mt tn o tin lnh (Protestant)
P(x) cng l ngi ci lng (Reformists) R(x). Ngha l chng minh suy lun:
x(Q(x) R(x)), x(P(x) Q(x)) x(P(x) R(x))
Chng minh:
1.

x(Q(x) R(x))

Gi thuyt

2.

x(P(x) Q(x))

Gi thuyt

3. x0

P(x0) Q(x0)

4.

Q(x0) R(x0) (xe) do 1

5.

Q(x0)

(e2) do 3

6.

R(x0)

(e) do 4, 5

7.

P(x0)

(e1) do 3

8.

P(x0) R(x0)

(i) do 7, 6

9.

x(P(x) R(x)) (xi) do 8

10.

x(P(x) R(x)) (xe) do 2, 3-9

Gi thit

Nu tt c cc tn phi gio hu (Quakers) Q(x) l nhng ngi ci lng

(Reformists) R(x) v nu c mt ngi theo o tin lnh (Protestant) P(x) ngi l
mt tn phi gio hu (Quakers) Q(x), th phi c mt tn o tin lnh
(Protestant) P(x) cng l ngi ci lng (Reformists) R(x).
V d 2:
xP(x), xy(P(x) Q(y)) yQ(y)
1

xP(x))

2.

xy(P(x)Q(y)) Gi thuyt

3.
4.
5.

Gi thuyt

y0
x0

P(x0)

Gi thit

y(P(x0)Q(y)

(xe) do 2

Le Huy Thap (Translator)

80

Logic in Computer Science

CHNG 5. SUY LUN T NHIN

6.

P(x0)Q(y0)

(ye) do 5

7.

Q(y0)

(e) do 6, 4

8.

Q(y0)

(xe) do 1, 4-7

9.

yQ(y)

(yi) do 3-8

V d 3: (Chng minh sai)

xP(x), x (P(x) Q(x)) yQ(y)
Chng minh:
1

xP(x))

Gi thuyt

2.

x(P(x) Q(x))

Gi thuyt

P(x0)

Gi thit

5.

P(x0) Q(x0)

(xe) do 2

6.

Q(x0)

(e) do 5, 4

7.

Q(x0)

(xe) do 1, 4-6

9.

yQ(y)

(yi) do 3-7

3.

x0

4.

x0

Ch sai chnh : C hai hp bin u l x0

Vi 2, yu cu x khng t do trong .
Chng ta s chng minh cho mt s trng hp. K thut chng minh thng dng l
tm ra cc cch chng minh tng t vi trng hp mnh sau nng ln thnh
trng hp v t.
1.

(p1 p2)

gi thuyt

2.

(p1p2)

gi thit

3.

p1

gi thit

4.

p1p2 (i1) do 3

5.

6.

p1

(e) do 4 , 2
do 3 - 5

3. p2

gi thit

4. p1p2 (i2) do 3
5.

6. p2

(e) do 4 ,2
do 3 5

Le Huy Thap (Translator)

81

Logic in Computer Science

CHNG 5. SUY LUN T NHIN

7.

(p1p2)

(i) do 6, 6

8.

(e) do 7 ,1

9.

p1p2 do 2 - 8

Case 1a: x x
Chng minh t tri sang phi ca x x :
1.

Gi thuyt

2.

Gi thit

3.

x0

4.

[x0|x]

Gi thit

5.

(x i) do 4

6.

(e) do 5 , 2

7.

[x0|x]

do 4 - 6

8.

(x i) do 3 7

9.

(e) do 8 , 1

10. x

do 2 - 9

Chng minh t phi sang tri ca x x :

1.

Gi thuyt

2.

Gi thit

3.

x0 [x0|x]

Gi thit

4.

[x0|x]

(x e) do 2

5.

(e) do 3 , 4

6.

(x e) do 1, 3-5

7.

(i) do 2 - 6

Case 2a:

x x( )

Tri qua phi ca x x( ):

Le Huy Thap (Translator)

82

Logic in Computer Science

CHNG 5. SUY LUN T NHIN

1.

Gi thuyt

2.

(e1) do 1

3.

(e2) do 1

4. x0 [x0| x]

(x e) do 2

5.

[x0| x]

(i) do 4, 3

6.

()[x0|x]

5, do x khng ty trong

7.

x( )

(x i) do 3 6

Phi qua tri ca x x( ):

x( )

Gi thuyt

x0 ( )[x0|x]
[x0|x]
[x0|x]

xe do 1
do 1 v x khng t do trong
(e1) do 3

5.

(xi) do 2-4

6.

( )[ t | x]

xe do 1

7.

[ t | x]

do 6 v x khng t do trong

8.

(e2) do 3

9.

1.
2.
3.
4.

3b x x x( )
Tri qua phi ca x x x( ):
1.

xx

gi thuyt

2.

gi thit

3. x0 [x0|x]

gi thit

4.

[x0|x] [x0|x]

(i) do 3

5.

( )[x0|x]

ng nht

6.

x( )

(x i) do 5

7.

x( )

(x e) do 2, 3-6

Le Huy Thap (Translator)

83

Logic in Computer Science

CHNG 5. SUY LUN T NHIN

2 - 7 tng t cho x
8.

x( )

(e) do 1,2-7, 2-7

Phi qua trica x x x( ):

1.

x( )

2.

x0 ( )[x0 | x]

gi thuyt
gi thit

3.

[x0 | x] [x0 | x] ng nht

4.

[x0 | x]

5.

(x i) do 4

6.

xx

( i) do 5

gi thit

4 6 Tng t cho [x0 | x]

7.

x x

( e) do 3,4-6,4-6

8.

x x

( e) do 1,2-7

Le Huy Thap (Translator)

84

Logic in Computer Science

CHNG 5. SUY LUN T NHIN

NG NGHA CA LOGIC V T
V d:
Gi s
F = {0, 1, s, +, *} v P = {=, , <, zero?}, y 0 , 1 l cc hng, s,
zero? c th nguyn l 1, nhng yu t cn li l nh nguyn. M hnh M ca chng ta l:
-

Domain: Tp s thc

0M l s 0, 1Mm l s 1; sM l hm tng; +M l cng; *M l nhn

M hnh =M ; M ; < M l cc quan h (cc php so snh), cn zero? M l kim tra

bng khng hay khng, ngha l zero?M(r) ly gi tr true khi v ch khi r = 0.
CHUI

V d:
F ={e , .}
P = {},
trong e l mt hng mt ngi v cc yu t cn li l nh nguyn. M hnh M ca
chng ta l:
-

Min: Tp cc chui (words)

eM l , t trng, .M ni chui

M cc m hnh quan h tip u ng ca, c ngha l M(, w) ng khi v ch

khi l tip u ng ca w.
CCH HIU TERMS

Mi term c hiu nh l mt gi tr, gip chng ta gn cc gi tr c th cho cc

bin.
nh ngha.
Mi trung l mt nh x l gn cho mi bin mt ga tr trong A. Chng ta cng k
hiu l[xa] cho mi trung n ng nht vi l, ngoi tr trng hp gi tr ca x l a.
nh ngha.
Gi s M
l mt m hnh trn (F,P) v t l mt term trn F. Khi chng ta k hiu
t l ga tr trong A c xc nh theo cc quy tc sau:
M,l

Nu t l bin x, th tM, l l l(x).

Nu t l hng f , th tM,l l fM.

Nu t l f(t1, t2, tn), th tM,l = f(t1M,l, t2M,l, tnM,l)

CCH HIU CC CNG THC

V d:

Le Huy Thap (Translator)

85

Logic in Computer Science

CHNG 5. SUY LUN T NHIN

F ={alma}, alma l hng, v t hai ngi P = {loves}, M c nh ngha bi

1. A = {a,b,c}
2. alma c hiu l a
3. loves c hiu l {(a,b); (b,a); (c,a)}
Kim tra cu nu:
None of almas lovers lovers love her
Gi s hnh thc ha ca chng ta l:
= xy(loves(x, alma) loves(y, x) loves(y, alma))
Cu tr li l khng:
M [xa, yb]loves(x, alma) loves(y, x) loves(y, alma) is F;
M [xa]yloves(x, alma) loves(y, x) loves(y, alma) is F;
M [ ]xyloves(x, alma) loves(y, x) loves(y, alma) is F;
Nu loves c hiu l {(b,a), (c,b)}
VN TNG NG SAU
V d
k = 3 v {(1, 101), (10, 00), (011, 11)
(s1,t1) = (1, 101)
(s2,t2) = (10, 00)
(s3,t3) = (011, 11)
Mt p n l i1=1, i2= 3, i3= 2, i4 = 3
Ngha l
s1s3s2s3 =

t1t3t2t3 =

101

011 10 011

101110011

11 00 11

101110011

Vy s1s3s2s3 = t1t3t2t3

Le Huy Thap (Translator)

86