There Are Two Goals to This Course# First, The Course Introduces Some Basic Notions That Will Be Needed As Background For Most Of The Cs Courses. The Second Goal# to Familiarize Students With Abstract Mathematical Thinking. Set Theory# Basic Definitions, Relations, Functions, Equivalence Relations, Orderings, Cardinality of Sets, Kantor's Diagonalization Methods. Logic# Propositional Calculus and First-order Logic# Semantics, Proof Systems, Soundness and Completeness Theorems, Compactness Theorems and Applications.

Faculty: Computer Science
|Undergraduate Studies

Pre-required courses

(44145 - Digital Systems and 234114 - Introduction to Computer Science) or (44145 - Digital Systems and 234117 - Introduction to Computer Science H) or (44145 - Digital Systems and 234111 - Introduction to Computer Science) or (234111 - Introduction to Computer Science and 234145 - Digital Systems) or (234114 - Introduction to Computer Science and 234145 - Digital Systems) or (234117 - Introduction to Computer Science H and 234145 - Digital Systems)


Course with no extra credit

44114 - Discrete Mathematics Ee 94344 - Discrete Mathematics (for I.e) 94345 - Discrete Mathematics (for I.e) 94346 - Discrete Mathematics 94347 - Discrete Mathematics 104002 - Basic Concepts in Mathematics 104290 - Set Theory 104293 - Set Theory 106156 - Mathematical Logic 234144 234292 - Logic For Cs


Semestrial Information