Final Exam Flashcards

(35 cards)

1
Q

contingency

A

Neither a tautology or always false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Disjunctive Syllogism

A

AorB, have B’, conclude A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Hypothetical Syllogism

A

A->B, B->C, conclude A->C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Contrapositive Property

A

(A->B) == (B’->A’)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

|A| =

A

cardinality of the set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How many terms are in the power set of n

A

2^n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

A and B are disjoint if…

A

Their intersection is the empty set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

A x B =

A

{ (a,b) : a exists in A and b exists in B}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Communitive Property for sets

A

A union B = B union A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Associative Property for sets

A

A U (B U C) = (A U B) U C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Distributive Property for sets

A

A U (B intersect C) = (A U B) intersect (A U C)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Identity property for sets

A

A U empty = A; A intersect S = A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Complement property for sets

A

A U A’ = S; A intersect A’ = empty

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Demorgans for set

A

(A intersect B)’ = A’ U B’

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Multiplication Principle for sets

A

|AxB| = |A||B|

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Addition Principle for sets

A

|AUB| = |A|+|B| - |A intersect B|

17
Q

Subtraction for set

A

|A-B| = |A| - |A intersect B|

18
Q

P(n,r) =

19
Q

P(n,1); P(n,n); P(n,0)

20
Q

C(n,r)=

21
Q

C(n,0);C(n,1);C(n,2);C(n,n);C(n,n-1)

A

1;n;n(n-1)/2;1;n

22
Q

Pascals identity

A

C(n,k) = C(n-1,k) + C(n-1, k-1)

23
Q

one to one relation

A

each point in one set connects to one point in the other set

24
Q

one to many relation

A

each point in one set connects to multiple points in the other set

25
many to one relation
multiple points in one set connect to one point in the other set
26
many to many relation
multiple points in one set connect to multiple points in the other set
27
reflexive
xpx
28
symmetric
(xpy)->(ypx)
29
transitive
(xpy)^(ypz) -> (xpz)
30
antisymmetric
(xpy)^(ypx) -> x=y
31
irreflexive
xnotpx
32
partial order set/poset
reflexive, transitive, antisymmetric
33
equivalence relation
reflexive, symmetric, transitive
34
graph
symmetric, irreflexive
35
equivalence relation implies?
there are partitions