ntsn

LUN L TON HC
(Mathematical Logic)
Nguyn Thanh Sn
Khoa KH&KT MT H Bch Khoa TpHCM
email : ntson@cse.hcmut.edu.vn
http:\\www.cse.hcmut.edu.vn\~ntson
ntsn
Chng 2 : Lun l mnh
ntsn
Chng 1
Ni dung
I. Cu trc ca lun l mnh (LLM)
II. Suy lun t nhin trong LLM
III. Ng ngha ca LLM
ntsn
I. Cu trc ca
lun l mnh
ntsn
Chng 1
Thut ng
[11]
Lun l mnh (LLM) c tn ting Anh :
Propositional logic.
Propositional Calculus.
T calculus l mt thut ng chung cho bt k
lnh vc ton hc lin quan ti vic tnh ton
(calculating).
Th d :
s hc c gi l calculus of numbers.
ntsn
Chng 1
Kho st 1 nh ngha LLM
[11]
Propositional Calculus l vic tnh ton trn cc
mnh (propositions hoc statement).
Mnh l cu khai bo c gi tr ng (T)
hoc sai (F).
xut hin mt s cu hi :
- cu khai bo l g (nh ngha) ?
- da vo u nh gi ng sai ?
ntsn
Chng 1
i tng ca LLM
Cc loi cu ca ngn ng t nhin (NNTN)
c nh ngha t Vn Phm ca NNTN.
LLM ch kho st cu khai bo.
Cu khai bo tha mt s iu kin c LLM
gi l cng thc nguyn (atom).
Cng thc nguyn (CTN) l phn t c bn ca
LLM.

ntsn
Chng 1
Cu khai bo

Th d :
tri s ma" l cu khai bo.
hy i ra khi lp" khng l cu khai bo.
"2+2 = 4" l cu khai bo.
"1 = 0" l cu khai bo.
ntsn
Chng 1
nh gi ng sai
Th d :
* i s l mt ngnh ton hc. ()
* Mi ngi cn c mt c tin. (|s)
* Mt tri l mt khi vung. (|s)
* 2+2 = 4. (|s)
* A. Lincoln l tng thng ca M. ()
ntsn
Chng 1
Cng thc nguyn
Cng thc nguyn (atom) l cu khai bo :
- c biu din bng mt k hiu.
- nh gi c , s.
- s nh gi ng sai khng thay i theo
khng gian & thi gian.
Gi tr ng sai ca 1 cu khai bo c gi l
thc tr (truth value).
ntsn
Chng 1
Cng thc nguyn
Th d :
on Th im l dch gi ca Chinh ph ngm
c k hiu l A (trong LLM).
Mt tri xoay quanh tri t.
c k hiu l B.
Nu hm s f lin tc th f kh vi.
c k hiu l C.
Phong i cu c vo ngy cha nht.
c k hiu l D.
ntsn
Chng 1
Cng thc
Th gii thc to s lin kt gia cu tng
kh nng din t.
Lun l mnh cng m phng li s lin kt
ny.
(AB)v(C.(D))
Cu + cu + cu + cu
Th gii thc
Lun l mnh
ntsn
Chng 1
Ton t
Ch mt s lin t trong th gii thc c m
phng li trong LLM thnh cc ton t.
v
.



hoc, hay,
v,
nu th ,
khng,
tng ng,
Th gii thc
Lun l mnh
ntsn
Chng 1
Cng thc
Cng thc hon ho l s kt hp hu hn ln
cc cng thc nguyn bng cc ton t
v, ., , .
Cng thc hon ho (well-formed formula -
WFF) c gi tt l cng thc (CT).
WFF c nh ngha dng BNF (Backus
Naur form)
| ::= t | (|) | (| . |) | (| v |) | (| |)
vi t l cng thc ngyn.
ntsn
Chng 1
i s Boolean
Lun l mnh c biu din di dng mt
cu trc i s.

<B, v, ., , >, vi B l tp cc bin logic.

Tp cc bin logic ca i s boolean tng ng
vi tp cc cng thc nguyn ca LLM.

Mt hm boolean tng ng vi mt cng thc
ca LLM.

ntsn
Chng 1
Cy phn tch
Cy phn tch (parse tree) l biu din bng
th ca mt cng thc. Cy phn tch l cy nh
phn c gc, nh l ton t v l l CT nguyn.
Th d : (Q P) . ((Q R) v R)
.


Q

P

v

Q

R

R

ntsn
Chng 1
Cy phn tch
ng (path) ca mt cy phn tch l mt
hnh trnh i t gc n nh l.
Th d :
.


X

v

Y

Z

X

ntsn
Chng 1
Cy phn tch
Chiu cao ca 1 cy phn tch l s cnh ca
con ng di nht cng 1.
Th d :
.

Y
X

v

Z

X

Chiu cao l 4
.

X



Y

Z
v
Chiu cao l 5

Z

X

ntsn
Chng 1
Ht slide
ntsn
Bi tp
Chng 2 : Lun l mnh
ntsn
Chng 1
Cu khai bo
1. Pht biu no l cu khai bo v ch ra thc tr :
a. Khng c m my tnh.
b. Thnh ph M Tho u ?
c. sng Si Gn khng c c su.
d. Vic lp trnh rt hng th.
e. A(BC) = (AB)(AC), A,B,C l tp hp.
f. Hm nay l ngy th 3.
g. 2 + 3 = 6.
h. H Ni l th ca VN.
i. Thit k CSDL l bt buc khi lp trnh.
ntsn
Chng 1
Cu khai bo
2. Tm ph nh ca cc cu khai bo sau :
a. sng Si Gn khng c c su.
b. A(BC) = (AB)(AC).
c. Hm nay l ngy th 3.
d. 2 + 3 = 6
e. H Ni l th ca nc VN.
f. Nu c tin ti s mua xe phn khi ln.
g. Thit k CSDL l bt buc khi lp trnh.
h. Ti ti lp mi khi gn c k thi.
i. S x l nguyn t nu n khng c c s khc 1, x.
ntsn
Chng 1
Cu khai bo
3. Biu din on vn sau bng lun l mnh :
Nu anh ta mua xe th anh ta trng s hoc tha
hng gia ti.
Anh ta khng tha hng gia ti.
Vy nu anh ta khng trng s th anh ta khng
mua xe.
ntsn
Chng 1
Cu khai bo
4. Din t cc cng thc lun l mnh bng cc
pht biu (cu khai bo) :
M = Hm nay th 5, N = i d ngoi
P = Cu c.
1. M (N v P)
2. M . N
3. P . M
4. N M
5. M v (P . N)
ntsn
Chng 1
Ht slide