Download presentation

Presentation is loading. Please wait.

Published byDean Gates Modified over 4 years ago

1
Union Intersection Relative Complement Absolute Complement Likened to Logical Or and Logical And Likened to logical Negation

2
The union of two sets is the set that contains elements belonging to either of the two sets Equivalent to the Boolean operation “or” Written as: Examples: A = {a, b, c, d}B = {c, d, e, f} A B = {a, b, c, d, e, f} Note that the set could have been described as {a, b, c, d, c, d, e, f}

3
A = {a, b, c, d} B = {c, d, e, f} A B = {a, b, c, d, e, f} A = {a, b, c, d} B = {x, y, z} A B = {a, b, c, d, x, y, z} Sets overlap Sets are disjoint

4
The intersection of two sets is the set of all elements common to both sets The intersection of disjoint sets is the empty set Equivalent to the Boolean operation “and” written as: Examples: A = {a, b, c, d} B = {a, b}B = {x, y, z} A B = {a, b}A B =

5
A = {a, b, c, d} B = {a, b} A B = {a, b} A = {a, b, c, d} B = {x, y, z} A B =

6
The relative complement (difference) of two sets is the set of elements contained in one, but not both, of the sets Related to the Boolean “Exclusive Or” Written as: — Examples: Given: A = {a, b, c, d} and B = {a, c, f, g} A — B = {b, d} B — A = {f, g}

7
A = {a, b, c, d} B = {a, c, f, g } A — B = {b, d} B — A = {f, g}

8
The absolute complement of a set is the set of elements which do not belong to the set being complemented’ Equivalent to the Boolean operation “not” Written as a superscripted ‘c’ Example: U = {a, b, c, d, e, u, v, w, x, y, z} A = {a, b, c, x, y, z} and B = {a, b, c, d, e} A c = {d, e, u, v, w} B c = {u, v, w, x, y, z}

9
U = {a, b, c, d, e, u, v, w, x, y, z} A = {a, b, c, x, y, z} B = {d, e, y, z} A c = {d, e, u, v, w}

10
Illustrates the 8 possible relations be- tween Sets, A, B and C

11
Shows whether an arbitrary element x be- longs in any of the indicated sets.

12
Idempotent Laws A A = A A A = A Associative Laws (A B) C = A (B C) (A B) C = A (B C) Commutative Laws A B = B A A B = B A

13
Distributive Laws A (B C) = (A B) (A C) A (B C) = (A B) (A C) Identity Laws A = A A U = U A U = A A =

14
Complement Laws A A c = U U c = A A c = c = U De Morgan’s Laws (A B) c = A c B c (A B) c = A c B c

Similar presentations

OK

Chapter 1. 1.1 SETS 1.1.1 DEFINITION OF SET 1.1.2 METHODS FOR SPECIFYING SET 1.1.3 SUBSETS 1.1.4 VENN DIAGRAM 1.1.6 SET IDENTITIES 1.1.5 SET OPERATIONS.

Chapter 1. 1.1 SETS 1.1.1 DEFINITION OF SET 1.1.2 METHODS FOR SPECIFYING SET 1.1.3 SUBSETS 1.1.4 VENN DIAGRAM 1.1.6 SET IDENTITIES 1.1.5 SET OPERATIONS.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google