Course Contents

Logic, Prepositional Equivalences, Predicates and Quantifiers. Integers, division in integers and Algorithms. Methods of proof: Rules of inference, Fallacies, Rules of inference for quantified statements, Methods of proving theorems, the halting problems. Mathematical Induction, Recursively Defined functions, Recursive Algorithms, Recurrence Relations, Solving Recurrence Relations, Relations & their Properties. Equivalence Relations, Partial ordering and Total ordering, Hasse diagrams, lattices. Basic Counting Principles. Permutation and Combination. Pigeonhole Principle.

Course Learning Outcomes

This course has been formulated to teach the student how to deal with discrete values, i.e., the techniques which depend on integers. Moreover this course teaches them different ways and techniques used for proofs of theorems, prepositions and lemmas.