This course serves as the foundational gateway to the mathematical theory of computation. Students will transition from computational problem-solving to formal mathematical reasoning, developing the rigor required to define, analyze, and prove the properties of computer science structures. The curriculum bridges abstract theory and practical application, covering the essential primitives of logic, set theory, and combinatorics.

Throughout the semester, students will explore the "why" behind computing by mastering formal proof techniques—including induction and recursion—and applying them to core CS domains such as algorithm analysis, cryptography, and models of computation. By the conclusion of the course, students will possess the mathematical vocabulary necessary for advanced study in algorithms, complexity, and data structures.