CISC 102 Lecture 4: Laws of Set Theory

91 views5 pages
bronzeskunk641 and 150 others unlocked
CISC 102 Full Course Notes
34
CISC 102 Full Course Notes
Verified Note
34 documents

Document Summary

A a = a (a b) c = a (b c) A (b c) = (a b) (a c) You can verify these properties with u = {1, 2, 3, 4, 5, 6, 7), a= {1, 2, 3}, You can verify these properties with u = {1, 2, 3, 4, 5, 5, 6}, a = {1, 2, 3}, b = {2, 4, 5} Definition: a set is said to be finite if s is empty or if s contains exactly m elements where m is a positive integer, otherwise s is infinite. We use (cid:448)erti(cid:272)al (cid:271)ars (cid:862)||(cid:863)to de(cid:374)ote the size or (cid:272)ardi(cid:374)alit(cid:455) of a fi(cid:374)ite set. B= {1, 2, 3, 4, 5, 6} so b= |6| Definition: the set of all (different) subsets of s is the power set of s, which we denote as p(s). If s is a finite set, we can prove that. : the empty set has 0 elements, and 1 subset.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions