click below
click below
Normal Size Small Size show me how
Discrete Math Stack
Discrete Math Intro
| Question | Answer |
|---|---|
| alphabet | finite set of symbols |
| word | an arrangement of symbols from an alphabet |
| sigma-star | all possible words over an alphabet |
| function | defined from a input set: "domain" to an output set: "codomain" |
| contradiction | always false |
| tautology | always true |
| contingency | not always true or false |
| identity laws | variable wins |
| domination laws | T or F wins |
| universe of discourse | all possible values of the predicate |
| lambda | null word |
| union | AuB |
| intersection | AnB |
| difference | A-B |
| complement | A' |
| symmetric difference | AoB = [(AuB)-(AnB)] |
| partition | a complete set of non-empty "disjoint" subsets |
| well ordering principle | every non-empty set of positive integers has a least element |
| division algorithm | for any a in Z and b in Z+, there exist q and r s.t. a=b*q+r where 0<=r<b |