Professional Documents
Culture Documents
Tugas Logika Matematika Dosen: Manda Rohandi, S.Kom, M.Kom
Tugas Logika Matematika Dosen: Manda Rohandi, S.Kom, M.Kom
LOGIKA MATEMATIKA
DOSEN: MANDA ROHANDI, S.KOM,M.KOM
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
≡ ∀ x(¬(x∈B) ¬(x∈A))
≡ ∀ x ¿)
≡ B́ ⊆ Á
A⊆B B́⊆ Á
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 ∈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}
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
Prove
A ⊕B={x|x ∈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}
={x|[x ∈A/\( ¬(x ∈A)\/ (x ∈A /\¬(x ∈B))] \/ [(x ∈B /\ ¬(x ∈A)) \/ (x ∈B /\ ¬(x
∈B))]}
=(A-B) U(B-A)
To prove A ⊕ A = Ø
Prove
A ⊕A = {x|x ∈A ⊕A}
={x|F}
The empty set does contain an ∈y elements and thus the statement x ∈ Ø is always false
={x|x ∈ Ø}
=Ø
to prove A ⊕ Ø=A
prove
A ⊕ Ø={x|x ∈A ⊕ Ø}
The empty set does not contain any elements and thus the statement x ∈ Ø is always false
={x|x ∈A/\T}
={x|x ∈A
=A
c. given U is the universal set
to prove A ⊕U = Á
prove
A ⊕U = {x|x ∈A ⊕U
The universal set contains all elements and thus the statement x ∈ U is always true
={x|x ∈ Á
= Á
to prove A ⊕ Á = U
prove
A ⊕ Á = {x|x A ⊕ Á
={x|T/\ T}
={x|T}
The universal set contains all elements and thus the statement x ∈ U is always true
={x|x ∈U}
=U
A ⊕B={x|x ∈A ⊕B}
={x|x∈B⊕A}
=B⊕A
={x|[x∈A\/x∈B]/\[(¬(x∈B)\/ x∈A\/¬(x∈B))]}
={x|[x∈A\/x∈B]/\[x∈A\/¬(x∈B)]}
={x|x ∈A\/[x∈B/\¬(x∈B)]}
={x|x ∈A}
=A
39. A ⊕B =A
Since all elememts of A are in A ⊕B, this means that A and B do not have any element in
common
A∩ B=Ø
x ∈B
x ∉A
x ∈A ⊕B
since A ⊕B= A
x ∈A
B= Ø
.
40.
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
44.
A B
45.
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
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 = Ø
50. U= {1,2,3,4,5,6,7,8,9,10}
a. {3,4,5} = 00111000
b. {1,3,6,10} = 1010010001
c. {2,3,4,7,8,9} = 0111001110
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
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
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
The unions contains all element in either of the two sets : {1,2,3,{1,2,3}}
the unions contain all elements in either of the two set. Note that emty set does not
contain any element { Ø}
The unions contains all element in either of two sets : { Ø,{ Ø}}
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
B = {2•a,3•b,4•d} or {a,a,b,b,b,d,d,d,d}