Quiz 0 Review Flashcards
(73 cards)
variables
boolean operations
5
truth tables
evaluating expressions
tautology
always true (law of excluded middle)
DeMorgan Laws
not (p or q) = not p and not q
not (p and q) = not p or not q
distributive laws
r or (p and q) = (r or p) and (r or q)
r and (p or q) = (r and p) or (r and q)
predicates
statements with variables
P(x) - x is even
quantifiers
for all and there exists
quantifiers DeMorgan Laws
not for all P(X) = there exists not P(x)
not there exists P(x) = for all not P(x)
notation for sets
enumeration: A = {a,b,c}
predicate: A= {x | x is even}
set operations (5)
union - combine
intersection - common
difference - in one but not the other
complement - everything not in it
cartesian product - pairs of elements
empty set
A union empty = A
A intersection empty = empty
infinite sets
countable vs uncountable
countable - listed in sequence
uncountable - real numbers between 0 and 1
sequence
ordered list, elements can repeat
notation: (a1,a2…) or {an} or (an)
set
unordered, elements do not repeat
notation: A = {a1,a2…}
sequence vs set
sequence is order with repeat
set is not ordered and do not repeat
relation
on A is a subset AxA
how elements relate to each other
reflexive
for all A, x,x is in A
every element is related to itself
symmetric
for all x and y, x,y is in A and y,x is in A
transmitive
for all x,y,z in A, x,y is in A, y,z, is in A so x,z is in A
anti symmetric
if x,y in A and y,x in R then x=y
partial orders
relation that is reflexive, anti symmetric, and transmitive
posets
partially ordered set, set with partial order
hasse diagrams
representing a partial order by removing reflexive edges and using directed edges to show ordering
1. draw all elements
2. make arrow relations
3. remove self loops
4. remove transitive edges (ab and bc…remove a to c)
5. bottom to top edges and remove all arrows