Transcription of Discrete Mathematics for Computer Science - UH
{{id}} {{{paragraph}}}
I. = . 1. ! |~ilHTerms Meaning SectionSets, Proof Templates, and Inductionx e A x is an element ofA f A x is not an element ofA x E A and P(x)} Set notation Natural numbers Integers Rationals Real numbers = B Sets A and B are equal C B A is a subset of B g B A is nota subset of B C B A is a proper subset of B 5 B A is nota proper subset of B a bimplies a b a if and only if b A union B A intersect B Generalized union of family of sets X Generalized intersection of family of sets X Xi Xm U.
1.1.3 Equality of Sets 4 1.1.4 Finite and Infinite Sets 5 1.1.5 Relations Between Sets 5 1.1.6 Venn Diagrams 7 1.1.7 Templates 8 1.2 Exercises 13 1.3 Operations on Sets 15 1.3.1 Union and Intersection 15 1.3.2 Set Difference, Complements, and DeMorgan's Laws 20 1.3.3 New Proof Templates 26 1.3.4 Power Sets and Products 28
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}