Busy. Please wait.

Forgot Password?

Don't have an account?  Sign up 

show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.

By signing up, I agree to StudyStack's Terms of Service and Privacy Policy.

Already a StudyStack user? Log In

Reset Password
Enter the email address associated with your account, and we'll email you a link to reset your password.

Remove ads
Don't know (0)
Know (0)
remaining cards (0)
To flip the current card, click it or press the Spacebar key.  To move the current card to one of the three colored boxes, click on the box.  You may also press the UP ARROW key to move the card to the "Know" box, the DOWN ARROW key to move the card to the "Don't know" box, or the RIGHT ARROW key to move the card to the Remaining box.  You may also click on the card displayed in any of the three boxes to bring that card back to the center.

Pass complete!

"Know" box contains:
Time elapsed:
restart all cards

Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

Discrete Math Stack

Discrete Math Intro

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
Created by: hey_bubba