Propositional logic starts the course with truth tables and visible cases, then moves into the language of proof: conditions, quantifiers, sets, functions, relations, graphs, counting, and induction. The course is built for CS and math students who want to read and write cleaner proofs, spot bad reasoning, and justify claims with precise examples before they generalize. By the end, the core discrete math objects are no longer just definitions, but usable proof tools.
Truth tables for propositional connectives, necessary and sufficient conditions, quantifier order, set operations, function types, equivalence relations, graph connectivity, factorial growth, Pascal’s triangle, and induction as a proof script. The course also touches proof-checking habits such as exact wording, labeled base cases, and inductive steps.