MATH 1190 Study Guide - Final Guide: Propositional Function, Surjective Function, Codomain

286 views9 pages

Document Summary

Express these statements without using quantifiers, instead using only negations, disjunctions, and conjunctions: expressing only using or and and, exists are denoted by or and for all is denoted by and, x((x 1) P(x): p(-5) and p(-3) and p(-1) and p(3) and p(5) Set unordered collection of objects called elements or members: two sets are equal if they have the same elements. A is a subset of b denoted by a b. Cardinality of s is the number of elements the set s has, denoted by |s| The power set of s is the set of all subsets of the set s: set builder notation: {0, 3, 6, 9, 12} 3. x z 0 x 3=0 it would be expressed as such. If you need to determine whether a number is an element of a set count brackets carefully: what is the cardinality of each of these sets, { , { }} = 2.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related textbook solutions

Related Documents

Related Questions