Introduction to the logical and mathematical foundations of computer science. Topics include functions, relations, and sets; recursion; elementary logic; and mathematical induction and other proof techniques.
Prerequisite
AMS 151 or MAT 125 or MAT 131
Course Outcomes
An ability to construct truth tables for various purposes, for example, checking if an argument is valid or if two propositions are equivalent.
An ability to argue with rigor and prove some theorems.
An ability to understand the mathematical concepts of sequences, functions, relations.
Textbook
Discrete Mathematics: Introduction to Mathematical Reasoning. Susanna S. Epp. 1st Edition