Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
12 Cards in this Set
- Front
- Back
|
The mathematical theory of counting is formally known as ______ |
Combinatorial analysis |
|
|
Set A is _________ to set B if there exists a function f:A maps B which us both one to one and onto. |
Equivalent |
|
|
The function f is said to define a ___________________ between sets A and B (if one to one and onto) |
One-to-one correspondence |
|
|
Two finite sets are equivalent if and only if they ____________________________ |
contain the same number of elements |
|
|
A set A is infinite whenever there exists a set B such that B is a ____________ of A and yet B maps A. Otherwise, set A is ____________ |
Proper subset Finite |
|
|
Set B is a __________ of A if all elements of B are in A but there exists at least one element in A that is not in B |
Proper subset |
|
|
If set A is a finite set then it is impossible for us to find a __________ of A that is __________ to A |
Proper subset Equivalent |
|
|
If a set D is equivalent to the set of positive integers then D is called ______________ |
Denumerable or countably infinite |
|
|
A set is ______________ if it is infinite and if it is not equivalent to the set of positive integers |
Non-denumerable |
|
|
If set A is a finite set then n(A) is called a _____________ and is equal to the number of elements in A. |
Finite cardinal |
|
|
The cardinal of any set equivalent to the set of positive integers is denoted by the first letter of Hebrew alphabet called _________ |
Aleph null |
|
|
The cardinal of sets equivalent to [0,1] is c and is said to have a ________________ |
Power of the continuum |
