1

Phn II
V t v lng t
:
1
V t v lng t
nh ngha:
Cho A l mt tp hp khc rng. Gi s,
ng vi mi x = a e A ta c mt mnh
p(a). Khi , ta ni p = p(x) l mt v t
theo mt bin (xc nh trn A)
2
V t v lng t
nh ngha:
Tng qut, cho A
1
, A
2
, A
3
l n tp hp
khc trng. Gi s rng ng vi mi
(x
1
,x
2
,.,x
n
) = (a
1
,a
2
,.,a
n
) eA
1
A
2
... A
n
, ta
c mt mnh p(a
1
,a
2
,.,a
n
). Khi ta ni p
= p(x
1
,x
2
,.,x
n
) l mt v t theo n bin(xc
nh trn A
1
A
2
... A
n
)
3
Predicates and Quantifiers
Propositional functions or predicates are propositions
which contain variables
Example Let P denote the Predicate is greater than 0
and P(x) denote x > 0
x is called a variable
The predicate become a proposition once the variable
x has been assigned a value.
Example
What is the truth value of p(5), p(0) and p(-2)?
5>0 is true, 0>0 is false and -2>0 is false
4
2
V t v lng t
V d 1:
Xt p(n) = n > 2 l mt v t mt bin xc nh
trn tp cc s t nhin N.
Ta thy vi n = 3; 4 ta c cc mnh ng
p(3), p(4), cn vi n = 0,1 ta c mnh sai
p(0), p(1).
5
V t v lng t
V d 2
Xt p(x,y) = x
2
+ y = 1 l mt v t theo hai bin
xc nh trn R
2
, ta thy p(0,1) l mt mnh
ng, trong khi p(1,1) l mt mnh sai.
6
Examples
Example:
Let Q(x,y) denote the statement y =x + 2.
What is the truth value of
Q(2,4,) and Q(4, 1)
4 = 2+2 is true and 1 = 4+2 is false
Q(2,y) v Q(0,3) is not a proposition: y is not bounded
Q(1,3) v Q(0,1) is a proposition which is true
Q(2,y) v Q(0,3) is a proposition???
Q(1,3) v Q(0,1) is a proposition ???
7
V t v lng t
nh ngha: Cho trc cc v t p(x), q(x) theo
mt bin x e A. Khi y,
Ph nh ca v t p(x) k hiu l p(x) l v t m khi
thay x bi mt phn t c nh ca A th ta c mnh
(p(a))
Php ni lin(tng ng ni ri, ko theo) ca p(x)
v q(x) c k hiu bi p(x) . q(x)( tng ng l
p(x)vq(x), p(x)q(x)) l v t theo bin x m khi thay
x bi phn t c nh a ca A ta c mnh
p(a). q(a) ( tng ng l p(a) v q(a), p(a)q(a))
8
3
V t v lng t
nh ngha:
Cho p(x) l mt v t theo mt bin xc nh trn A. Ta
nh ngha cc mnh lng t ha ca p(x) nh sau:
Mnh Vi mi x thuc A,p(x), k hiu bi x e A, p(x), l
mnh c nh bi x e A, p(x) ng khi v ch khi p(a)
lun ng vi mi gi tr a e A .
Mnh Tn ti(t nht )(hay c (t nht) mt x thuc A, p(x)) k
hiu bi :-x e A, p(x) , l mnh c nh bi -x e A,
p(x) ng khi v ch khi c t nht mt gi tr x = a
0
no sao
cho mnh p(a
0
) ng.
Ch : Cc mnh lng t ha trn u l cc mnh
c chn tr xc nh ch khng cn l cc v t theo
bin x na.
9
Universe of Discourse
Question
Let R be the three-variable predicate R(x,y,z):
x+y = z
Find the truth value of
R(2,-1,5), R(3,4,7) R(x,3,z)
A universe of discourse (U) is a domain for the
variables of a propositional function.
Example
Let U = Z, the integers = {, -2, -1, 0, 1, 2, }
10
Universal quantifier
The Universal Quantifier of P(x):
is the proposition
P(x) is true for every x in the universe of discourse
Notation: x P(x)
`For all x, P(x) `For every x, P(x)
Example:
U = {1, 2, 3} x P(x) P(1) . P(2) . P(3)
Example
What is the truth value of x P(x) if P(x) is 3x <10and
U is positive integers not exceeding 4
P(1) . P(2) . P(3) . P(4) is false
11
Existential quantifier
The Existential Quantifier of P(x):
is the proposition
P(x) is true for some x in the universe of discourse
Notation: -x P(x)
For some x P(x) For at least an x in P(x)
Example:
U = {1, 2, 3}, -x P(x) P(1) v P(2) v P(3)
Example
What is the truth value of -x P(x) if P(x) is 3x <10and
U is positive integers not exceeding 4
P(1) v P(2) v P(3) v P(4) is True
12
4
V t v lng t
1) Menh e x e R, x
2
+ 3x + 1 s 0 la mot menh e sai
hay ng ?
2) Menh e -x e R, x
2
+ 3x + 1 s 0 l mot menh e ung hay sai?
Mnh sai v ton tai x
0
= 1 e R ma x
0
2
+ 3x
0
+ 1 > 0
Menh e ung v ton tai x
0
= 1 e R ma x
0
2
+ 3x
0
+ 1 s 0.
13
V t v lng t
Menh e x e R, x
2
+ 1 > 2x la mot menh e ung
hay sai?
Mnh ng v vi x e R, , ta luon luon co
x
2
-2x + 1 > 0
Mnh e -x e R, x
2
+ 1 < 0 la mot menh e
ng hay sai?
14
V t v lng t
nh ngha:
Cho p(x, y) la mot v t theo hai bien x, y xac nh tren
AB. Ta nh ngha cac menh e lng t hoa cua p(x,
y) nh sau:
x e A,y e B, p(x, y) = x e A, (y e B, p(x, y))
x e A, -y e B, p(x, y) = x e A, (-y e B, p(x, y))
-x e A, y e B, p(x, y) = -x e A, (y e B, p(x, y))
-x e A, -y e B, p(x, y) = -x e A, (-y e B, p(x, y))
15
V t v lng t
Xet v t p(x, y) = x + 2y < 1 theo hai bien x, y xac nh tren
R
2
Mnh x e R, y e R, x + 2y < 1 ng hay sai?
Mnh sai v tn ti x
0
= 0, y
0
= 1 e R m x
0
+ 2y
0
> 1.
Mnh x e R, -y e R, x + 2y < 1 ng hay sai?
Mnh ng v vi mi x = a e R, tn ti y
a
e R nh
y
a
= a/2, sao cho a + 2y
a
< 1.
16
5
V t v lng t
Mnh -x e R, y e R, x + 2y < 1 ng hay sai
Mnh sai v khng th c x = a e R bt ng thc
a + 2y < 1 c tha vi mi y e R (chng hn, y =a/2 + 2
khng th tha mn bt ng thc ny)
Mnh -x e R, -y e R, x + 2y < 1 ng hay sai?
Mnh ng v tn ti x
0
= 0, y
0
= 0 e R chng hn, tha
mn
x
0
+ 2y
0
< 1.
17
Translate into English
Example
Translate the statement
x(C(x) v -y(C(y) .F(x,y))) into English
Where C(x) is x has a computer
F(x,y) is x and y are friends
and U is x and y are students in your school
For every student x in your school x has a computer or
there is a student y such that y has a computer and x and y are friends.
18
Example
Example:Let U = R, the real numbers. P(x,y): xy = 0
xy P(x,y)
x -y P(x,y)
-x y P(x,y)
-x -y P(x,y)
False
True
True
True
Example: Let U={1, 2, 3}. Find an expression equivalent to x -y P(x,y) where the
variables are bound by substitution instead:
Solution: -y P(1,y) . -y P(2,y) . -y P(3,y)
[P(1,1) v P(1,2) v P(1,3)] .
[P(2,1) v P(2,2) v P(2,3)] .
[P(3,1) v P(3,2) v P(3,3)]
19
V t v lng t
Cho p(x, y) la mot v t theo hai bien x, y xac nh
tren AB. Khi o:
1) x e A, y e B, p(x, y)
y e B, x e A, p(x, y)
2) -x e A, -y e B, p(x, y)
-y e B, -x e A, p(x, y)
3) -x e A, y e B, p(x, y)
y e B, -x e A, p(x, y)
Chieu ao cua 3) noi chung khong ung.
20
6
V t v lng t
Chng minh 3)
Gi s -x e A, y e B, p(x, y) l ng.
Khi , tn ti a e A sao cho y e B, p(x, y)
l ng, ngha l nu thay y = b e B bt k th
p(a,b) ng. Nh vy, y = b e B tu chn th ta
c th chn x = a -x e A, p(x, y) l ng.
Do , y e B, -x e A, p(x, y) l mnh
ng.
21
V d th hin chiu o ca 3 l cha chc ng:
Gi p(x,y) l v t theo 2 bin thc
p(x,y) = x + y = 1,
Nu thay y tu th x = 1 - y cho x + y = 1
nn mnh -x e A, p(x, y) l ng.
Nn mnh ye B, -x e A, p(x, y) l ng.
Ngc li, nu chn x = a tu , ta c th chn
y = -a y e B, p(x, y) l sai.
iu ny chng t, -x e A, y e B, p(x, y) l sai.
Do , php ko theo sau l sai:
y e B, -x e A, p(x, y) -> -x e A, y e B, p(x,
y)
22
V t v lng t
Trong mt mnh lng t ho t mt
v t theo nhiu bin c lp, nu ta hon
v hai lng t ng cnh nhau th:
1. Mnh mi vn cn tng ng logic vi
mnh c nu hai lng t ny cng loi.
2. Mnh mi ny s l mt h qu logic ca
mnh c nu hai lng t trc khi hon
v c dng -
23
V t v lng t
nh l:
a) Vi p(x) la mot v t theo mot bien xac nh tren
A, ta co:
b) Phu nh cua menh e lng t hoa t v t p(x
1
,
x
2
, ..., x
n
) co c bang cach thay lng t bang
lng t - va ngc lai, va thay v t p(x
1
, x
2
, ...,
x
n
) bang v t .
( ) ( ) , , x A p x x A p x e - e
( ) ( ) , , x A p x x A p x - e e
( )
1 2
, ,...,
n
p x x x
24
7
Negation
Equivalence involving the negation operator
x P(x) -x P(x)
-x P(x) x P(x)
Multiple Quantifiers: read from left to right
25
V t v lng t
Phu nh cua menh e Hom nay, moi sinh vien lp
TH1eu co mat la g ?
Phu nh cua menh e Trong lp TH2co (t nhat mot) sinh vien c
thng la g?
Hom nay, co (t nhat) mot sinh vien lp TH1vang mat.
Trong lp TH2khong co sinh vien nao c thng.
26
V t v lng t
Phu nh cua menh e x e A, 2x + 1 s 0 la g ?
Phu nh cua menh e
c > 0, -o > 0, x e R, , x a, < o ,f(x) f(a), < c.
(ieu kien e ham so f(x) lien tuc tai x = a)
Phu nh cua menh e trn l -x e A, 2x + 1 > 0.
Phu nh cua menh trn la:
-c > 0, o > 0, -x e R, , x a, < o . (,f(x) f(a), > c).
27
V t v lng t
Qui tc c bit ho ph dng:
Nu mt mnh ng c dng lng t
ho trong mt bin x e A b buc bi
lng t ph dng , khi y nu thay th x
bi a e A ta s c mt mnh ng.
28
8
V t v lng t
V d:
Mi ngi u cht
Socrate l ngi
Vy Socrate cng cht
29
Qui tc tng qut ho ph dng:
Nu trong mt mnh lng t ho, khi
thay mt bin buc bi lng t bng
mt phn t c nh nhng tu ca tp
hp tng ng m mnh nhn c c
chn tr 1 th bn thn mnh lng t ho
ban u cng c chn tr 1.
V t v lng t
30
Inference Rules for Quantifiers
x P(x)
P(o) (substitute any object o)
P(g) (for g a general element of u.d.)
x P(x)
-x P(x)
P(c) (substitute a new constant c)
P(o) (substitute any extant object o)
-x P(x)
31
Example
Every man has two legs, John Smith is a man.
Therefore, John Smith has two legs.
Predicates: M(x): x is a man
L(x): x has two legs
J: John Smith is a member of the universe
1. x[M(x) L(x)]
2. M(J) L(J)
Proof 1. x[M(x) L(x)] Hypothesis 1
2. M(J) L(J) Step 1 and UI
3. M(J) Hypothesis 2
4. L(J) Step 2 and 3 and modus
ponens
32
9
thi
1) Hy xc inh chn tr ca mnh sau:
a) 2002
xeR,(x
2
-4x -5=0)(x>0)
b) 2004
xeR,(x
3
- 4x
2
+5x -2=0)(x
2
-3x+2 = 0)
2) 2003
Ly ph nh ca mnh sau:
c>0,-o>0, x, x

eR,(|x-x |<o |f(x)-f(x) |< c)

33
thi
3) Kim tra tnh ng n ca suy lun sau:
a) 2005
xeR(P(x) v Q(x))
xeR(P(x). Q(x)R(x))
________________________
xeR(R(x)P(x))
b) 2006
xeR, P(x) v xeR, Q(x))
-xeR, P(x)
___________________
xeR,Q(x) 34
thi
c) 2007
x (P(x) Q(x))
- x (P(x) . R(x))

- x (Q(x) . R(x))
trong P(x), Q(x) v R(x) l 3 v t
35
thi
4) 2007.Cho bit suy lun sau ng khng ?Ti sao?
x(P(x) v Q(x))
x(Q(x) R(x))
R(a)
___________
P(a)
Trong P(x), Q(x) v R(x) l 3 v t v a l mt
phn t ca tp v tr
36
10
thi
5) 2009.
a) Mt dy s thc {x
n
}c ni l thuc O(n) nu tn ti s
thc dng C v s t nhin m sao cho ,x
n
,< Cn mi khi
n > m. Hy s dng mnh lng t ha vit li nh
ngha trn.
b) Vit ra mnh lng t ha cho mt dy s thc {x
n
}
khng thuc O(n).
37
thi
6) 2010. Kim tra tnh ng n ca suy lun sau
x(P(x) v Q(x))
x(Q(x) vR(x))
-x P(x)
___________
-x R(x)
Trong P(x), Q(x) v R(x) l 3 v t
38
Bi tp
7)
Xet chan tr va tm phu nh cua cac menh e sau:
a) x e R, x
2
3x + 2 s 0;
b) -x e R, x
2
3x + 2 s 0;
c) x e N, y e R, x + y > 0;
d) x e N, -y e R, x + y > 0;
e) -y e R, x e N, x + y > 0;
f) -x e N, -y e R, x + y > 0;
g) x e Z, y e R, x + y > 0;
h) x e Z, -y e R, x + y > 0;
39
Ti liu tham kho
[1]GS.TS Nguyn Hu Anh, Ton ri rc,
NXB Gio dc
[2]TS. Trn Ngc Hi, Ton ri rc
[3] Dr.Kossi Edoh,Department of Computer
Science, Montclair State University
[4] Michael P.Frank s slides
40