TUGAS

LOGIKA MATEMATIKA
DOSEN: MANDA ROHANDI, S.KOM,M.KOM

NAMA : FARIZAL AFWAN AHMAD

NIM : 531420048
PRODI: S1-SISTEM INFORMASI
KELAS : B
31. to prove A ⊆ B if and only of B́U Á

Prove by the definition of subset, A ⊆ B is logically equivalent with all element for wich: if x
is an element of A, then x is an element of B

A ⊆B≡ ∀x(x∈A x∈B)

Use logical equivalence

≡ ∀ x(￢(x∈B) ￢(x∈A))

By the definition of complement

≡ ∀ x ¿)

By the definition subset

≡ B́ ⊆ Á

Since A ⊆ B is logicallly equivalent with B́⊆ Á , A⊆B  B́⊆ Á is a tautology

A⊆B B́⊆ Á

Thus A ⊆ B if and only of B́U Á is always true

32. A = { 1,3,5}

B= {1,2,3}

We note that 1 are noth sets. Thus 1 and 3 are not in the symetric difference A ⊕B

5 is an element of A, that is not in B. thus % is in the symmetric difference A ⊕B

5 ∈A ⊕ B

2 is an element of B, that is not in A. thus 2 is in the symmetric difference A ⊕B

2 ∈A ⊕B

We have discussed all element in A and B, thus the only element in the symmetric
difference A ⊕B are then 2 and 5

A ⊕B = {2,5}

33. A= all computer sciemce major

B = all mathematics major

The symmetric difference A ⊕B then contains : all computer major and mathematics
majors, but no majors that are both computer science major and mathematics major

34.

The symmetric difference of A and B, denoted by A ⊕B, is the set containing those elements
in either A or B, but not in both A and B

35. to prove A ⊕B = (A UB)-(A∩ B)

Prove

A ⊕B={x|x ∈A ⊕B}

By the definition of symmetric difference A ⊕B, x has to be an element of A or an element

of B, but not an element of both

={x|(x ∈A\/x ∈B)/\ ￢(x ∈A/\x ∈B)}

By the definition of union

={x|(x ∈A UB)/\ ￢(x ∈A/\x ∈B)}

By the definiti ∈on intersection

={x|(x ∈A UB)/\ ￢(x ∈A ∩ B ¿ }

By the definition of the difference

={x|x ∈(A UB)-(A∩ B ¿ }

A ⊕B =(A UB)-(A∩ B ¿
36. to prove A ⊕B = (A - B) U (B - A)

Prove

A ⊕B = {x|x ∈A ⊕B}

By the symmetric diference A ⊕B, x then has to be an element of A or an element of B, but

not an element of both

={x|x ∈A\/ x ∈B) /\ ￢(x ∈A/\ x ∈B)}

Use de morgan law

={x|(x ∈A \/ x ∈B) /\ (￢(x ∈A)\/ ￢(x ∈B))}

Use distributive law

={x|[x ∈A/\( ￢(x ∈A)\/ (x ∈A /\￢(x ∈B))] \/ [(x ∈B /\ ￢(x ∈A)) \/ (x ∈B /\ ￢(x
∈B))]}

Use negation law

={x|[F\/(x ∈A /\ ￢(x ∈B))] \/ [(x ∈B /\ ￢(x ∈A)) \/ F]}

Use identity law

={x|[x ∈A /\ ￢(x ∈B)]\/[x ∈B /\ ￢(x ∈A)]}

Use definition of ifference

={x|[x ∈(A-B)] \/ [x ∈(B-A)]}

By the definition of union

={x|x ∈(A-B) U(B-A)}

=(A-B) U(B-A)

37. a. given U is the universal set

To prove A ⊕ A = Ø

Prove

A ⊕A = {x|x ∈A ⊕A}

By the definition of symmetric difference A ⊕A, x then has to be an element of A or an

element of A , but not both
 ={x|x ∈A \/ x ∈A) /\ ￢(x ∈A/\ x ∈A)}

Use the idempotent law

={x|x ∈A/\ ￢(x ∈A)}

Use negation law

={x|F}

The empty set does contain an ∈y elements and thus the statement x ∈ Ø is always false

={x|x ∈ Ø}

=Ø

b. given U is universal set

to prove A ⊕ Ø=A

prove

A ⊕ Ø={x|x ∈A ⊕ Ø}

By the definition of symmetric difference A ⊕ Ø, x then hasto be an element of A or Ø, but

not an element of both

={x|(x ∈A\/x ∈ Ø)/\ ￢(x ∈A/\x ∈ Ø)}

The empty set does not contain any elements and thus the statement x ∈ Ø is always false

={x|x ∈A\/F)/\ ￢(x ∈A/\F)

Use identity law

={x|x ∈A/\ ￢(x ∈A/\ F}

Use domination law

={x|x ∈A/\ ￢F}

={x|x ∈A/\T}

Use identity law

={x|x ∈A

=A
c. given U is the universal set

to prove A ⊕U = Á

prove

A ⊕U = {x|x ∈A ⊕U

By the definition of symmetric difference A ⊕U, x then has to be element of A or an element

U, but not an element of both

={x|(x ∈A\/x ∈U)/\ ￢(x ∈A/\ x ∈U)}

The universal set contains all elements and thus the statement x ∈ U is always true

={x|(x ∈A\/ T) /\ ￢(x ∈A/\T)}

Use the domination law

={x|T/\ ￢(x ∈A/\T)}

Use identity law

={x| ￢(x ∈A)}

Use definition of the complement

={x|x ∈ Á

= Á

d. given U is theuniversal set

to prove A ⊕ Á = U

prove

A ⊕ Á = {x|x A ⊕ Á

By the definition of symmetric difference A ⊕ Á , x then has to be an element of A or an

´ , but not an element of both
element of Á

={x|(x ∈A\/x ∈ Á ) /\ ￢(x ∈A/\x ∈ Á )}

Use definition of the complement

={x|(x ∈A\/ ￢(x ∈A))/\ ￢(x ∈A/\ ￢(x ∈A))}

Use negation law

={x|T/\ T}

Use identity law

={x|T}

The universal set contains all elements and thus the statement x ∈ U is always true

={x|x ∈U}

=U

38.a. to prove A ⊕B=B ⊕A

A ⊕B={x|x ∈A ⊕B}

By the definition of symmetric difference A ⊕B, x then has to be an element of A or an

element of B, but not an element of both

={x|(x ∈A\/x ∈B) /\ ￢(x ∈ A/\x ∈B)}

Use commutative law

={x|(x∈ B \/ x∈A)/\ ￢(x∈B/\x∈A)}

By the definition of symmetric difference

={x|x∈B⊕A}

=B⊕A

b. to prove (A⊕B) ⊕B=A

(A⊕B) ⊕B={x|x∈(A⊕B) ⊕B}

By the definition of symmetric difference A⊕B, x then has to be an element of A or an

element of B, but not an lement of both

={x|([(x∈A\/x∈B) /\ ￢(x∈A/\x∈B)]\/ x∈B)/\ ￢([(x∈A\/x∈B)/\ ￢(x∈A/\x∈B)]/\x∈B)}

Use de morgan law

={x|([(x∈A\/Ax∈B)/\( ￢(x∈A)\/ ￢(x∈B))]\/ x∈B)/\([ ￢(x∈A\/x∈B) \/￢(￢

(x∈A/\x∈B))]\/ ￢(x∈B))}

Use double negation

={x|([(x∈A\/Ax∈B)/\( ￢(x∈A)\/ ￢(x∈B))]\/ x∈B)/\([ ￢(x∈A\/x∈B) \/
(x∈A/\x∈B))]\/ ￢(x∈B))}

Use de morgan law

={x|([(x∈A\/x∈B)/\( ￢(x∈A)\/ ￢(x∈B))]\/ x∈B)/\([ ￢(x∈A/\x∈B) \/ (x∈A/\x∈B))]\/

￢(x∈B))}

Use distributive law

={x|[(x∈A\/x∈B \/ x∈B)/\( ￢(x∈A)\/ ￢(x∈B)\/x∈B)]/\(( ￢(x∈A) /\￢

(x∈B))\/[(x∈A\/ ￢(x∈B))/\(x∈B\/￢(x∈B))]}

Use negation law

={x|[(x∈A\/x∈B \/ x∈B)/\( ￢(x∈A)\/T)\/x∈B)]/\(( ￢(x∈A) /\￢(x∈B))\/[(x∈A\/ ￢

(x∈B))/\(x∈B))/\T]}

Use identity law

={x|[x∈A\/x∈B\/x∈B]/\[( ￢(x∈A) /\ ￢(x∈B)) \/ x∈A\/￢(x∈B)]}

Use idempotent law

={x|[x∈A\/x∈B]/\[( ￢(x∈A) /\ ￢(x∈B)) \/ x∈A\/￢(x∈B)]}

Use distributive law

={x|[x∈A\/x∈B]/\[( ￢(x∈A) \/ x∈A\/￢(x∈B)) /\(￢(x∈B)\/ x∈A\/￢(x∈B))]}

Use negation law

={x|[x∈A\/x∈B]/\[( T\/￢(x∈B)) /\(￢(x∈B)\/ x∈A\/￢(x∈B))]}

Use identity law

={x|[x∈A\/x∈B]/\[(￢(x∈B)\/ x∈A\/￢(x∈B))]}

Use idempotent law

={x|[x∈A\/x∈B]/\[x∈A\/￢(x∈B)]}

Use distributive law

={x|x ∈A\/[x∈B/\￢(x∈B)]}

Use negation law

 ={x|x ∈A\/F]}

Use identity law

={x|x ∈A}

=A

39. A ⊕B =A

By the definition symmetric difference A ⊕B, x then has to be an element of A or an

element B , but not an element of both

A ⊕B= {x|(x ∈A\/x ∈B) /\ ￢(x ∈A/\ x ∈B)}

Since all elememts of A are in A ⊕B, this means that A and B do not have any element in
common

A∩ B=Ø

Assumption let x be an element of B

x ∈B

since A∩ B=Ø , x can then not in be in A

x ∉A

by the definition of the symmetric difference, x then has to be an element of A ⊕B

x ∈A ⊕B

since A ⊕B= A

x ∈A

conclusion however, now we obtained a contradivtion, because we derrived x ∈A

and x ∉A(wich cannot both be true at the same time).thus our assumption x ∈B was false
and thus B cannot contain any elements

B= Ø

.
40.

A B C B⊕A A⊕B A ⊕ (B⊕C) (A⊕B) ⊕C

0 0 0 0 0 0 0
0 0 1 1 0 1 1
0 1 0 1 1 1 1
0 1 1 0 1 0 0
1 0 0 0 1 1 1
1 0 1 1 1 0 0
1 1 0 1 0 0 0
1 1 1 0 0 1 1

41. were given A⊕C = B⊕C wich is same as AUC-A⋂C = BUC-B⋂C

If A is empty, then B =Ø as well. We can assume that A in non empty and let x∈A

Case 1 – x ∈C

Then x∈A⋂C which implies that x∉A⊕C wich implies ffrom above equality that
x∉B⊕C

Case 2 - x∉C

Then x∈A⊕C wich implies from the first equality that x∈B⊕C. but x∉C. the only way
x∈B⊕C is if x∈B

Thus we have shown that if x∈A then x∈B. for the other way we can repeat the
argument as above or we can note that is the problem is symmetric in A and B (that
is we can replace A by B an B by A in the problem) an appeal to symmetri to
complete the solution

42.

(A⊕B) (A⊕C)
A B C D A⊕B C⊕D A⊕C B⊕D
⊕(C⊕D) ⊕(B⊕D)
1 1 1 1 0 0 0 0 0 0
1 1 1 0 0 1 0 1 1 1
1 1 0 1 0 1 1 0 1 1
1 1 0 0 0 0 1 1 0 0
1 0 1 1 1 0 0 1 1 1
1 0 1 0 1 1 0 0 0 0
1 0 0 1 1 1 1 1 0 0
1 0 0 0 1 0 1 0 1 1
 0 1 1 1 1 0 1 0 1 1
0 1 1 0 1 1 1 1 0 0
0 1 0 1 1 1 0 0 0 0
0 1 0 0 1 0 0 1 1 1
0 0 1 1 0 0 1 1 0 0
0 0 1 0 0 1 1 0 1 1
0 0 0 1 0 1 0 1 1 1
0 0 0 0 0 0 0 0 0 0

43. (A⊕B) ⊕(C⊕D) = (A⊕D) ⊕(B⊕C)

(A⊕B) ⊕(C⊕D)= A⊕(B⊕(C⊕D)) use associative property

=A⊕(B⊕(D⊕C)) use commutative property

= A⊕((B⊕D) ⊕C) use associative property

=A⊕(D⊕(B⊕C)) use associative property

=(A⊕D) ⊕(B⊕C) use associative property

44.

A B

45.

¿ i=1 ¿ n Ai= {1 } U {1,2 } U … U { 1,2,3 ,… . , n }= { 1,2,3, … , n }=A n

¿ i=1 ¿ n Ai= {1 } ⋂ {1,2 } ⋂ … ⋂ { 1,2,3 ,… . , n }= {1 }=A 1

46.
¿ i=1 ¿ n Ai=¿ i=1 ¿ n❑ { … ,−2 ,−1,0,1 … . , n }= {−2 ,−1,0,1 }=Z

¿ i=1 ¿ n Ai=¿ i=1 ¿ n❑ {−2,−1,0,1 }=−2 ¿

47.

a.
¿ i=1 ¿ n Ai= An

b.
¿ i=1 ¿ n Ai= A 1

48. a. A1 = {1,2,3…}

A2 = {2,3,4…}

A3 = {3,4,5…}

An ⊆ A1 for all n

An ⋂ An-1 = An for all n

Hence ¿ i=1 ¿ ∞ Ai = A1 = {1,2,3,…} and ¿ i=1 ¿ ∞ Ai = Ø

b. A1 = {0,1}

A2 = {0,2}

A3 = {0,3}

A4 = {0,4}

¿ i=1 ¿ ∞ Ai = {0,1,2,3,…}

¿ i=1 ¿ ∞ Ai = {0}

c. A1 = (0,1)

A2 = (0,2)

A3 =(0,3)

A4 = (0,4)

¿ i=1 ¿ ∞ Ai = (0, ∞)

¿ i=1 ¿ ∞ Ai = (0,1)
d. . A1 = (1, ∞)

A2 = (2, ∞)

A3 =(3, ∞)

A4 = (4, ∞)

A1⊃ A2 ⊃ A3 ⊃ A4

¿ i=1 ¿ ∞ Ai = (1, ∞)

¿ i=1 ¿ ∞ Ai = Ø

49. a ¿ i=1 ¿ ∞ Ai={−∞ , … ,−1,0,1 , … ,+∞ }=Z∧¿ i=1 ¿ ∞ Ai ¿={−1,0,1}

b. ¿ i=1 ¿ ∞ Ai={ … ,−3 ,−2 ,−1,1,2,3 , … }=Z− { 0 }∧¿ i=1 ¿ ∞ Ai=Ø

c. ¿ i=1 ¿ ∞ Ai=(−∞ , ∞ )=R∧¿i=1 ¿ ∞ Ai= A 1=[−1,1]

d. ¿ i=1 ¿ ∞ Ai=A 1=[ 1 , ∞ ) ∧¿ i=1¿ ∞ Ai=Ø

50. U= {1,2,3,4,5,6,7,8,9,10}

If the I bit in the string is a 1, then I is the set

If the I bit in the strng is a 0, then I is NOT in the set

a. {3,4,5} = 00111000
b. {1,3,6,10} = 1010010001
c. {2,3,4,7,8,9} = 0111001110

51. given U = {1,2,3,4,5,6,7,8,9,10}

If the I bit in the string is a 1, then I is the set

If the I bit in the strng is a 0, then I is NOT in the set

a. 1111001111 = {1,2,3,4,7,8,9,10}
b. 0101111000 = {2,4,5,6,7}
c. 1000000001 = {1,10}

52. a. sunce all bits are zeroes, there no elements in the set. Hence the set is the empty
set
 b. since all bits are ones, all elements are present in the set. Hence the set is the
universal set

53. the bit in the I position of the bit string for the difference is 1 if the I bit of the first
string is 1 abd the I bit of the second string is 0, and is 0 otherwise

54. if bit A=0 and B=0 : syymetric difference bit = 0

If bit A=0 and B=1 : symmetric diference bit = 1

If bit A=1 and B=0 : symmetric difference bit = 1

If bit A=1 and B=1 : symmetric difference bit = 0

55. A = {a,b,c,d,e}

B = {b,c,d,g,p,t,v}

C = {c,e,I,o,u,x,y,z}

D = {d,e, h,I,n,o,t,u,x,y}

The alphabet contains 26 letter, thus each string need to contain 26 bits

A : 11111 00000 00000 00000 00000 0

B : 01110 01000 00000 10001 01000 0

C : 00101 00010 00001 00000 10011 1

D : 00011 00110 00011 00001 10011 0

a. A U B : 11111 01000 00000 10001 01000 0 = {a,b,c,d,e,g,p,t,v}

b. A ⋂ B : 01110 00000 00000 00000 00000 0 = {b,c,d}
c. A U D : 11111 00110 00011 00001 10011 0
B U C : 01111 01010 00001 10001 11011 1
(A U D) ⋂ (B UC) : 01111 00010 00001 00001 10011 0 = {b,c,d,e,I,o,t,u,x,y}
d. A U D : 11111 00110 00011 00001 10011 0
B U C : 01111 01010 00001 10001 11011 1
A U B U C U D : 11111 01110 00011 10001 11011 1
={a,b,c,d,e,g,h,I,n,o,p,t,u,v,x,y,z}

56. union

If either string contains a 1 on the i bit , then the union contains a 1 on the i bit as
well
 It both string contains a 0 on the I bit , then the union contains a 0 on the I bit

Intersection

If either string contains a 1 on the i bit , then the intersection contains a 1 on the i
bit as well

It both string contains a 0 on the I bit , then the intersection contains a 0 on the I bit

57. a. the successor of {1,2,3} is {1,2,3} U {{1,2,3}}

The unions contains all element in either of the two sets : {1,2,3,{1,2,3}}

b. the successor of Ø is U {Ø}

the unions contain all elements in either of the two set. Note that emty set does not
contain any element { Ø}

c. The successor of { Ø} is { Ø} U{{ Ø}}

The unions contains all element in either of two sets : { Ø,{ Ø}}

d. The succesor of{ Ø,{ Ø}} is { Ø,{ Ø}} U {{ Ø,{ Ø}}}

The unions contain all elements in either of the two set : { Ø,{ Ø} ,{ Ø,{ Ø}}}

58. the successor of A is A U {A}. basically, the successor of the set A is the set A with the
element {A} added to it

Thus the successor of A contains one more element than the set A

If the set A then contains n elements, then the successor of A contains n+1 elements

59. A= {3• a,2•b,1•c} or {a,a,a,b,b,c}

B = {2•a,3•b,4•d} or {a,a,b,b,b,d,d,d,d}

a. AUB = {3•a,3•b,1•c,4•d} or {a,a,a,b,b,b,c,d,d,d,d}

b. A⋂B = {2•a,2•b} or {a,a,b,b}
c. A-B = {1•a,1•c} or {a,c}
d. B-A = {1•b,4•d} or {b,d,d,d,d}
e. A+B = {5•a, 5•b,1•c, 4•d} or {a,a,a,a,a,b,b,b,b,b,c,d,d,d,d}

60. A = {107•personal computers,44•routers, 6•servers}

B = {14•personal computers,6•routers,2•main frames}

a. AUB = {107•personal computers,44•routers,6•servers,2•main frames}
b. A⋂B = {14•personal computers,6•routers}
c. B-A = {(14-107) •personal computers,(6-44)•routers,(0-6) •servers,(2-0)
•main frames}
={(-93) •personal computers,(-38) •routers,(-6) •servers,2•main frames}
A negative multiplicity means that element is not in the set
B-A = {2•main frames}
d. A+B = (A⋂B) U(A⋂B) U(A-B) U(B-A)
={(14+14+93) •personal computers,(6+6+38) •routers,6•servers,2•main
frames}

={121•personal computers,50•routers,6•servers,2•main frames}