AMS 151 or MAT 125 or MAT 131

• An ability to define and use discrete structures such as functions, relations, and sets.
• An ability to compute with recursion as a basic paradigm.
• An ability to use logic and basic proof techniques, such as mathematical induction.

Susanna Epp, “Discrete Mathematics with Applications”, Brooks/Cole (Thomson), 4th ed., 2010, ISBN: 978-0495391326.

• Introduction: sets, functions, logic
• Functions
• Recursive Functions
• Programming in Standard ML
• Inductive Definitions of Sets
• Examples of Induction Proofs
• Binary Relations
• Equivalence Relations
• Cardinality of Sets
• Countability and Uncountability
• Propositional Logic
• Formal Reasoning
• Predicate Logic and Quantifiers