SetForLogic Feb2010-Logic

L THUYT TP HP
Nguyn Thanh Sn
Khoa KH&KT MT H BK TpHCM
Email ntson@cse.hcmut.edu.vn
@ Nguyen Thanh Sn Khoa CNTT HBK TpHCM
1 s
CC VN C BN
Khi nim nh ngha trong ton hc
Hnh thc
Phn loi
S dng
Khi nim nh l
nh
B
H lun.
Mnh .
Khi nim Chng minh
2 s
PHNG PHP CHNG MINH
Chng minh trc tip.
Chng minh bng dng tng ng
eg : A (BC) (A . B) C.
Chng minh phn chng.
eg : AB (A . B) mu thun.
Chng minh truy chng.
* Hu hn.
* V hn.
Chng minh bng phn th d.
3 s
CHNG MINH TRUY CHNG
Cho mt h v hn mnh P
1
, P
2
, P
3
,
Chng minh tt c P
i
u ng.
4
P
n+1

P
1

P
n

P
2

Chng minh P
1
ng
-
-
-
Gi s P
n
ng
Chng minh Pn+1 ng
Truy chng hu hn (trn tp N) : Dng 1.
Tt c P
i
u ng
s
CHNG MINH TRUY CHNG
Truy chng hu hn (trn tp N) : Dng 2
5
P
n+1

P
1

P
n

P
2

Chng minh P
1
ng
-
-
-
Chng minh P
n+1
ng
Tt c P
i
u ng
-
Truy chng v hn hay siu hn (trn tp R).
Gi s P
2
P
n
ng
s
PHNG THC XC NH
Lit k
* Cc phn t c chn ty .
* Tp hp cng lm l m c.
* khng c 2 phn t trng nhau.
* Cc phn t khng c trt t.
Trng tnh
* Cn mt tp hp cho trc.
* Tp hp c th t n khng m c.
6
TP HP
s
CC TP HP
Tp trng : C.
Tp con :
X _ Y (x)( x eX x eY).
Tp 2
X
= P(X)
(power set = power of set).
Tp ph dng.
Tp tch bit.
Tp hu hn, v hn, m c,
7 s
TP CC TP CON
Tm tp tt c tp con ca X = {1, 2} ?.

Tp C _ X,
{1} _ X,
{2} _ X,
{1, 2} _ X.
Ly cc tp con trn bin thnh phn t ca mt
tp hp k hiu l 2
X
hay P(X).

Vy 2
X
= {C, {1}, {2}, {1, 2}}.
8 s
TP CC TP CON
Tm tp tt c tp con ca X = {a, b, c} ?.

Tp con 0 phn t : C.
Tp con 1 phn t : a {a}, b {b}, c {c}.
Tp con 2 phn t : a, b {a, b}, a, c {a, c}, b, c {b, c}.
Tp con 3 phn t : a, b, c {a, b, c}.

Vy 2
X
= {C, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}}.
9 s
NH X
S dnh dng ny l nh x t A vo B ?
10
a
c
b
d
* Mt phn t ca A ch dnh dng vi 1 phn t ca B
* Mi phn t ca A phi dnh dng vi phn t ca B.
Hai iu kin l nh x t A vo B :
s
PHN LOI NH X
nh x 1-1 t A vo B
11
nh x trn t B vo A
a
c
b
a
c
b
s
MC NHIN THA
Nu iu kin th Hu qa.

12
Th d :

P = Nu ti c tin th ti hc Cao hc.

Tnh trng 1 : c tin + hc Cao hc.
Tnh trng 2 : c tin + khng hc Cao hc.
Tnh trng 3 : khng c tin + hc Cao hc.
Tnh trng 4 : khng c tin + khng hc Cao hc.
s
KHI NIM NH NGHA
Hnh thc
Khi nim cn nh ngha Cc iu kin.

Th d :

nh ngha ton t cha trong c :
A c X (x)(x e A x e X)
13 s
KHI NIM NH NGHA
Dng s dng trong thc t :
Cc iu kin Khi nim cn nh ngha.

Th d :
nh ngha ton t cha trong c :
( x)(x e A x e X) (A c X)

14 s
MC NHIN THA
Ap dng.
Chng minh : C c X, X.

nh ngha cha trong :
A c X (x)(x e A x e X)
Ly A = C.
Khi nim cha trong tr thnh :
C c X (x)(x e C x e X)
Mnh (x e C x e X) mc nhin tha.
Vy C c X, X.
15 s
CU TRC I S
X l mt CTS X l tp hp + Hu hn ton t.

Th d :
x + y = y + x, (giao hon)
(x + y) + z = x + (y + z), (phi hp)
x + 0 = 0 + x = x, (0 l pt trung ha ca +)
x * 1 = 1 * x = x, (1 l pt trung ha ca *)
x + (x) = (x) + x = 0, (x l pt nghch o)
x * (y + z) = (x * y) + (x * z), (* phn b vi +).
16 s
PHNG TRNH I S
X + a = b, vi a < b N.
X + a = b, vi a > b Z.
aX = b, vi a = 0 Q.
X
2
= 2 R.
X
2
+ 1 = 0 C.

Dng tng qut :

a
n
X
n
+ a
n1
X
n1
+ a
n2
X
n2
+ + a
2
X
2
+ a
1
X + a
0
= 0,
n v cc a
i
l s nguyn.
17 s
CU TRC I S
Th d :
<X, o> l groupoid nu X l tp hp v o l ton t cp 2.
<X, o> l bn nhm nu l groupoid v phi hp.
<X, o> l nhm nu l groupoid, phi hp,
c phn t trung ha, c phn t nghch o.
<X, o, |> l vnh nu <X, o> l nhm giao hon,
<X, |> l bn nhm v | phn b vi o.
Nhng cu trc i s khc :

Vnh giao hon, min nguyn, vnh chia, trng, modul, khng gian
vector, lattice, i s boolean.
18 s
CTS - NHM
Mt cu trc i s <X, -> vi - l ton t cp 2 c :
Tnh phi hp
(a, b, c) (a - b) - c = a - (b - c)
Phn t n v
( -u)( x) (x - u = u - x = x)
Phn t o
(x) ( -x*) (x - x* = x* - x = u)
@ Nguyen Thanh Sn Khoa CNTT HBK TpHCM 19 s
CTS - VNH
Mt cu trc i s <X, , -> vi , - l ton t cp 2 c :
<X, > l nhm
Tnh giao hon ca
(a, b) (a b = b a).
Tnh phi hp ca -
(a, b, c) (a - b) - c = a - (b - c)
Tnh phn b ca - i vi
a - (b c) = (a - b) (a c)
(b c) - a = (b - a) (c a)
20 s
CTS - TRNG
Mt cu trc i s <X, , -> vi , - l ton t cp 2 c :
<X, , - > l vnh
<X {0 }, - > l nhm giao hon
(0 l phn t n v ca )
@ Nguyen Thanh Sn Khoa CNTT HBK TpHCM 21 s
CU TRC I S
Tng quan gia cc tp hp thng dng :
N c Z c Q c R c C c nhm quaternion.

Cc cu trc i s :
< N, +> l bn nhm.
< Z, + , * > l vnh.
< Q,+ , * > l trng.
< R, + , * > l trng.
< C, + , * > l trng.
22 s
TNH CHT QUAN TRNG CA N
Mi tp con khc trng ca N c phn t cc tiu.

* Cc tp Z, Q, R, C khng c tnh cht trn.
23
1

2

3

4

5

6

7

8

9

n

s
L THUYT TP HP
QUAN H
24 s
TCH HAI TP HP
Ly A = {a, b, c}, B = {1, 2, 3, 4}
A B = {(a, 1), (a, 2), (a, 3), (a, 4),
(b, 1), (b, 2), (b, 3), (b, 4),
(c, 1), (c, 2), (c, 3), (c, 4)}.

Mi phn t (x, y) ca tp tch (A B) :
* l mt cp c th t (ie, xeA v ye B).
25 s
TCH HAI TP HP
A B = {o , (a)(b) (aeA v beB vo = (a,b))}.
hay
A B = { (a, b) , aeA v beB }.

M rng :

A
1
A
2
A
3
A
n
= { (a
i
)
i
, a
i
e A
i
}.
26 s
TNH CHT CA TCH
A B = B A.
A C = C.
C A = C.

To hai tp hp tch bit :

A {0} v B {1}.
27
B
A
B {1}
A {0}
s
QUAN H
Phn loi ngn ng lp trnh
28
Smalltalk
Lisp
Cobol
Pascal
C++
Fortran
Prolog
Cu trc Hm Logic Object
s
QUAN H

Biu din quan h loi ngn ng lp trnh bng tp hp.

{(Pascal, cutrc), (C++, cu trc), (C++, itng),
(Fortran, cutrc), (Prolog, logic), (Small talk, object),
(Cobol, cutrc), (Lisp, hm)}.
29 s
QUAN H
Quan h R trn tp X = {a, b, c, d, e}.
a b c d e
a
b
c
d
e
30
Biu din bng tp hp :

R = {(a, a), (a, c), (b, a), (b, d),
(b, e), (c, a), (c, c), (d, c),
(d, e), (e, a)}

s
QUAN H
R l quan h ca A v B R _ A B.

Phn t ca R c vit di dng :
(x, y) e R, hay xRy.
A c gi l Min tr ca R.
B c gi l Min nh ca R.
Nu X _ A v Y _ B th
X cng l min tr ca R,
Y cng l min nh ca R.
31 s
QUAN H
R l quan h ca A v B.
C cng l quan h ca A v B.
A B cng l quan h ca A v B.

Nu A = B th
A = {(x, x) , (x)(x e X)}
c gi l quan h ng cho.
32 s
QUAN H
Tm min tr v min nh ca quan h e ?.
Th d :
3 e N,
a e{a, b, c, d}

Tm min tr v min nh ca quan h _ ?.
Th d :
{3} _ N,
{c, d} _ {a, b, c, d}
33 s
TON T TRN QUAN H
Hi 2 quan h :

(R S) (x)(y)((x, y) e R v (x, y) e S)
hay
(R S) ((x, y) e R) v ((x, y) e S).
34 s
TNH CHT CA QUAN H
Trng hp min tr v min nh trng nhau :

Phn hi (reflexive).

i xng (symmetric).

Phn i xng (antisymmetric).

Truyn (transitive).
35 s
QUAN H PHN HI
Quan h "song song" gia cc ng thng.
mi ng thng u song song vi chnh n.

Quan h "bn" gia cc sinh vin trong lp.
sinh vin A l bn vi chnh anh ta.

Quan h "s" trn tp hp s nguyn.
25 s 25.
(40, 40) e s.
36 s
QUAN H PHN HI
Phn hi :

(x)( (x, x) e R ).

Nhn xt :
Tnh phn hi ph thuc vo min tr.
37 s
QUAN H PHN HI
Quan h R = {(a, a), (a, b), (a, d), (b, b), (b, a), (c, c), (d, d)}
l phn hi trn tp X = {a, b, c, d}.

Quan h R khng phn hi trn tp X' = {a, b, c, d, e}.
38 s
QUAN H PHN HI
Quan h phn hi cha ng cho.
a b c d e
a
b
c
d
e
39 s
QUAN H PHN HI
Quan h _ ca tp hp c phn hi khng ?.

Quan h y chia chn cho x (x = ky) trn tp hp cc s
nguyn c phn hi khng ?.

Quan h modulo c phn hi khng ?.

Quan h R = {(a, b), (a, c), (a, a), (b, d), (b, b), (b, c), (c, c), (c,
d), (d, d), (c, d)} c phn hi khng ?.
40 s
QUAN H KHNG PHN HI

Quan h "thng gc" gia cc ng thng.
mi ng thng khng thng gc vi chnh n.

Quan h "c" trn cc tp hp.
A . A.
41 s
QUAN H KHNG PHN HI

Phn hi :

(x)( (x, x) e R ).

Khng phn hi :

(-x)( (x, x) e R ).
42 s
QUAN H I XNG

ng thng (d) song song ng thng (h)
th (h) cng song song vi (d).

Quan h "bn" gia cc sinh vin trong lp.
sinh vin A l bn ca B th B cng l bn ca A.
43 s
QUAN H I XNG

i xng :

(x)(y)( ((x, y) e R) ((y, x) e R) ).
44 s
QUAN H I XNG
.
45 s
QUAN H KHNG I XNG

Quan h "c" trn cc tp hp.
A c B nhng B . A.
(hay (A, B) e c v (B, A) e c )

Quan h "s" trn tp hp s nguyn.
(40, 50) e s nhng (50, 40) e s.
46 s
QUAN H KHNG I XNG
i xng :

(x)(y)( ((x, y) e R) ((y, x) e R) ).

Dng (a b) tng ng vi (a v b).
Ph nh ca (a b) l ( a . b).
Khng i xng :

(-x)(-y)( ((x, y) e R) . ((y, x) e R) ).
47 s
QUAN H KHNG I XNG
.
48 s
QUAN H PHN I XNG

Quan h "xp hng" mua v xem phim.
nu A xp hng trc B th khng xy ra s kin
B xp hng trc A.

Quan h "cha ca".
A l cha ca B th B khng th l cha ca A.
49 s
QUAN H PHN I XNG

Phn i xng

(x)(y)( ( (x, y) e A . (x, y) e R ) (y, x) e R ),

hay

(x)(y)( ( (x, y) e R . (y, x) e R ) (x = y) ).
50 s
QUAN H PHN I XNG
.
51 s
Q.H KHNG PHN I XNG

Quan h "thy ca".
A l thy B, nhng B cng c th l thy A.

Quan h "trc phng" ca cc vector trong
khng gian 3 chiu.
vector A trc phng vi vector B
th B cng trc phng vi A.

52 s
Q.H KHNG PHN I XNG

Phn i xng

(x)(y)( ( (x, y) e R . (y, x) e R ) (x = y) ).

Khng phn i xng :

(-x)(-y)( (x, y) e R . (y, x) e R . (x = y) ).

53 s
Q.H XNG & PHN XNG
Quan h khng i xng v khng phn i xng.
54 s
QUAN H TRUYN

Quan h "xp hng" mua v xem phim.
nu A trc B v B trc C th A xp hng trc C.

ng thng (d) // (h) v (h) // (k) th (d) // (k).
55 s
QUAN H TRUYN

Truyn

(x)(y)(z)(( (x, y) e R . (y, z) e R) ) (x, z) e R) ).
56 s
QUAN H KHNG TRUYN

Quan h "cha ca".
A l cha ca B v B l cha ca C nhng
A khng l cha ca C.

Quan h "bn ca".
A l bn ca B v B l bn ca C nhng
A khng chc l bn ca C.
57 s
QUAN H KHNG TRUYN
Truyn

(x)(y)(z)( ( (x, y) e R . (y, z) e R) ) (x, z) e R) ).

Khng truyn

(-x)(-y)(-z)( (x, y) e R . (y, z) e R . (x, z) e R ).
58 s
SO SNH CC TNH CHT
Phn hi : (x)( (x, x) e R).
Khng ph : (-x)( (x, x) e R ).
i xng : (x,y)( ((x, y) e R) ((y, x) e R) ).
Khng px : (-x,y)( (x, y) e R . (y, x) e R . (x = y)).
Khng x : (-x,y) ( ((x, y) e R) . ((y, x) e R) ).
Phn x : (x,y) ( ((x, y) e A . (x, y) e R) (y, x) e R)
(x,y) ( ((x, y) e R . (y, x) e R) (x = y)).
Truyn : (x,y,z)( ((x,y) e R . (y,z) e R)) (x,z) e R)).
Khng tr : (-x,y,z) ( (x, y) e R . (y,z) e R . (x, z) e R)
59 s
CC QUAN H C BIT

* (truyn + i xng) khng dn n phn hi.
60
c c c c A
c khng c c X X
c c c khng C
Truyn Phn i xng i xng Phn hi Quan h
s
L THUYT TP HP
QUAN H TNG NG
61 s
QUAN H TNG NG
Phn hi.
i xng.
Truyn.

Th d :

* Quan h song song gia cc ng thng.
* Quan h modulo.
62 s
QUAN H TNG NG

Ly X = {1, 2, 3, 4, 5, 6, 7, 8}.

R = {(1,1), (2,2), (1,2), (6,1), (2,6), (3,5), (8,7), (3,3),
(4,4), (2,1), (1,6), (5,5), (6,6), (5,3), (6,2), (7,8),
(7,7), (8,8)}.

Chng minh quan h R l quan h tng ng.
63 s
QUAN H TNG NG
R = {(1,1), (2,2), (1,2), (6,1), (2,6), (3,5), (8,7), (3,3), (4,4),
(2,1), (1,6), (5,5), (6,6), (5,3), (6,2), (7,8), (7,7), (8,8)}.
Phn hi : cha ng cho.
i xng :
(1, 2) c (2, 1), (6, 1) c (1, 6),
(2, 6) c (6, 2), .
Truyn :
(1, 2) + (2, 6) (1, 6),
(1, 2) + (2, 1) (1, 1), .
64 s
QUAN H MODULO

Quan h modulo n trn s nguyn Z c nh ngha nh sau :

n | (x y),

hay x = y mod (n),

hay x = y + kn, vi k e Z.
65 s
QUAN H MODULO

Th d :

Quan h modulo 7 trn s nguyn Z :

3 v 17 c quan h modulo 7 vi nhau
v 17 3 = 27
32 v 17 khng quan h modulo 7 vi nhau
v 32 17 = k 7.
66 s
QUAN H MODULO
Modulo l quan h tng ng.
Phn hi
x = x + 0n, vi 0 e Z x mod(n) x.
i xng
x mod(n) y hay y = x + ( k)n y mod(n) x.
Truyn
x mod(n) y v y mod(n) z,
hay x = y + kn v y = z + k'n.
x = z + k'n + kn = z + (k' + k)n x mod(n) z.
Vy modulo n l quan h tng ng.
67 s
QUAN H MODULO
Cc phn t c quan h modulo (5) vi nhau :
68
1
0
2
3
4
5
6
7
8
9
6
12
14
s
LP TNG NG
Lp tng ng ca phn t a trn quan h tng ng R.
a/R = {x , (x) (a, x) e R}
Th d :
Modulo 5 c cc lp tng ng :
{0, 5, 5, 10, 10, 15, 15, } ly pt i din 0.
{1, 6, 4, 11, 9, 16, 14, } ly pt i din 1.
{2, 7, 3, 12, 8, 17, 13, } ly pt i din 2.
{3, 8, 2, 13, 7, 18, 12, } ly pt i din 3.
{4, 9, 1, 14, 6, 19, 11, } ly pt i din 4.
Z
5
= { 0 , 1 , 2 , 3 , 4 }.
69 s
LP TNG NG
Cho quan h tng ng R trn tp X.

* Cc lp tng ng cch bit nhau.

X b ct thnh nhng mnh ri nhau bi quan h R.
70 s
PHN HOCH
Phn hoch trn tp X l ct X thnh nhng mnh ri nhau.

* Mi phn hoch trn tp X xc nh mt quan h tng
ng S c cc lp tng ng trng vi cc mnh ct.
71 s
NG DNG CA Q.H T.
To khi nim mi (t tn pt i din).
Quan h song song khi nim "phng".

Thu nh kch thc tp hp (chn pt i din).
Tp Z
p
.
Xy dng tp hp mi.
Xy dng tp Z bng quan h tng ng
R = {((m, n), (m+1, n+1)) , (m, n) m, n e N}
trn tp tch N N.
72 s
L THUYT TP HP
QUAN H TH T
73 s
QUAN H TH T
Phn hi.
Phn i xng.
Truyn.
s
QUAN H TH T
R = {(a, c), (a, d), (a, e), (d, d), (a, g), (a, h), (a, i), (a, j),
(a, k), (b, d), (i, i), (b, g), (b, i), (b, b), (c, d), (c, e), (c, g),
(c, h), (c, i), (e, e), (k, k), (c, j), (g, g), (c, k), (f, f), (d, g),
(d, i), (e, g), (h, h), (e, h), (j, j), (c, c), (e, i), (e, j), (e, k),
(f, h), (f, j), (f, k), (g, i), (h, j), (h, k), (a, a)}
Quan h th t ?.
Min tr = {a, b, c, d, e, f, g, h, i, j, k}
Phn hi
Phn i xng
Truyn.
s
QUAN H TH T
Quan h th t ton phn.
(x, y)( (x, y) e R v (y, x) e R)).
e
d
c
b
a
a
b
c
d
e
f
s
QUAN H TH T
Quan h th t ring phn.
( (x, y)( (x, y) e R v (y, x) e R)) ).
(-x, y)( (x, y) e R . (y, x) e R)).
i
h
g
f
e
d
c
b
a
k
j
i
g
e
d
c
a
k
b
f
s
CC I-CC TIU

Phn t cc i (maximum) ca quan h th t R l phn t :
c quan h vi mi phn t,
ch bn tri khi quan h vi phn t khc.
TI I-TI TIU
i
g
e
d
c
a
k
b
f
h
j
s
CC I-CC TIU

Phn t cc tiu (minimum) ca quan h th t R l phn t :
c quan h vi mi phn t,
ch bn phi khi quan h vi phn t khc.
TI I-TI TIU
i
g
e
d
c
a
k
b
f
h
j
s
CC I-CC TIU

Phn t ti i (maximal) ca quan h th t R l phn t :
ch bn tri khi c quan h vi cc phn t khc.
( khng cn c quan h vi mi phn t).
TI I-TI TIU
i
h
g
f
e
d
c
b
a
k
j
s
CC I-CC TIU

Phn t ti tiu (minimal) ca quan h th t R l phn t :
ch bn phi khi c quan h vi cc phn t khc.
( khng cn c quan h vi mi phn t).
TI I-TI TIU
i
h
g
f
e
d
c
b
a
k
j
s
NH NGHA MAX-MIN
R l quan h th t trn X v S _ X.
Cc i (maximum) ca quan h R l phn t max tha :
(x e X) (max, x) e R.
Cc tiu (minimum) ca quan h R l phn t min tha :
(x e X) (x, min) e R.
Ti i (maximal) ca quan h R l phn t maxl tha :
(x e X) ((maxl = x) ((x, maxl) e R)).
Ti tiu (minimal) ca quan h R l phn t minl tha :
(x e X) ((minl = x) ((minl, x) e R)).
s
CHN TRN-CHN DI

Chn trn (upper bound) ca S l phn t :
quan h c vi mi phn t ca S,
ch bn tri khi c quan h vi cc phn t ca S.
LUB-GLB
i
h
g
f
e
d
c
b
a
k
j

S
s
CHN TRN-CHN DI

Chn di (lower bound) ca S l phn t :
quan h c vi mi phn t ca S,
ch bn phi khi c quan h vi cc phn t ca S.
LUB-GLB
h
g
f e
d
c
b
a
k
j
i

S
s
CHN TRN-CHN DI

Chn trn nh nht (least upper bound) ca S l :
chn trn ca S,
phn t cc tiu ca tp chn trn ca S.
K hiu : lub(S) hay sup(S).

LUB-GLB
i
h
g
f
e
d
c
b
a
k
j

S

s
CHN TRN-CHN DI

Chn di ln nht (greatest lower bound) ca S l :
chn di ca S,
phn t cc i ca tp chn di ca S.
K hiu : glb(S) hay inf(S).

LUB-GLB
i
h
g
f
e
d
c
b
a
k
j

S

s
LUB-GLB
R l quan h th t trn X v S l tp con ca X. Tm lub(S).
lub(S) e S.
i
g
e
d
c
a
k
b
j
S

s
LUB-GLB
lub(S) e S
i
g
e
d
c
a
k
b
j
S

s
LUB-GLB
lub(S) khng tn ti.
i
h
g
f
e
d
c
b
a
k
j

S

s
LUB-GLB
R l tp s thc.
on thng [0, ] {1}
S = [0, 1[
0
1
15
16
R
lub(S) khng hin hu

s
NH NGHA LUB-GLB
Chn trn ub ca tp S l phn t tha :
(x e S) (ub, x) e R.
Chn di lb ca tp S l phn t tha :
(x e S) (x, lb) e R.
Chn trn nh nht (lub) ca tp S l phn t tha :
lub(S) = min{ub | (x e S) (ub, x) e R}.
Chn di ln nht (glb) ca tp S l phn t tha :
glb(S) = max{lb | (x e S) (x, lb) e R}.
s
NH NGHA LUB-GLB
R l quan h th t trn X.
Kho st trng hp S = X.
Chn trn ub ca tp S l phn t tha :
(x e X) (ub, x) e R ub = max.
Chn di lb ca tp S l phn t tha :
(x e X) (x, lb) e R ub = min.
Chn trn nh nht : lub(S) = max.
Chn di ln nht : glb(S) = min.
Vy max, min l trng hp c bit ca lub v glb.
s
L THUYT TP HP
HT CHNG
s

SetForLogic Feb2010-Logic

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

SetForLogic Feb2010-Logic

Uploaded by

Copyright:

Available Formats

L THUYT TP HP

You might also like