Major objective of this course is to provide students with proficiency in fundamentals of formal reasoning, including set theory, propositional and first order logic, functions, recursion, relations, counting, combinatorics, and proof techniques, including inductive proofs. On exit, students should be prepared for learning material on computation theory and computer algorithms, and should be capable of demonstrating fundamentals of a rigorous approach to algorithm and program design and development . Students should be able to construct formal expressions of problem statements, and to reason about and formally prove basic set theoretic, functional and counting properties. Students will possess knowledge and skills for fundamental formal reasoning in a complex world.