- #1
Jhenrique
- 685
- 4
First: relating some ideia of set theory and binary logic, like:
U = 1
Ø = 0
thus, some identities appears:
U ∪ U = U
U ∪ Ø = U
Ø ∪ U = U
Ø ∪ Ø = Ø
U ∩ U = U
U ∩ Ø = Ø
Ø ∩ U = Ø
Ø ∩ Ø = Ø
1 + 1 = 1
1 + 0 = 1
0 + 1 = 1
0 + 0 = 0
1 × 1 = 1
1 × 0 = 0
0 × 1 = 0
0 × 0 = 0
So, the conclusion is that the operation of Union is analogous to AND, and the Intersection is analogous to OR.
But, one thing no is clear for me yet: and the binary operation XOR, XOR have a analogue in set theory?
U = 1
Ø = 0
thus, some identities appears:
U ∪ U = U
U ∪ Ø = U
Ø ∪ U = U
Ø ∪ Ø = Ø
U ∩ U = U
U ∩ Ø = Ø
Ø ∩ U = Ø
Ø ∩ Ø = Ø
1 + 1 = 1
1 + 0 = 1
0 + 1 = 1
0 + 0 = 0
1 × 1 = 1
1 × 0 = 0
0 × 1 = 0
0 × 0 = 0
So, the conclusion is that the operation of Union is analogous to AND, and the Intersection is analogous to OR.
But, one thing no is clear for me yet: and the binary operation XOR, XOR have a analogue in set theory?