Description:
Propositional and first order logic. Equivalence, inference. Mathematical induction, diagonalization principle. Set operations, relations, functions. Lattices, Boolean algebras. Truth tables and minimization of Boolean expressions. Applications to CPS.
Description:
Propositional and first order logic. Equivalence, inference. Mathematical induction, diagonalization principle. Set operations, relations, functions. Lattices, Boolean algebras. Truth tables and minimization of Boolean expressions.
Description:
Propositional and first order logic. Equivalence, inference. Mathematical induction, diagonalization principle. Set operations, relations, functions. Lattices, Boolean algebras. Truth tables and minimization of Boolean expressions.
Description:
Propositional and first order logic. Equivalence, inference and method of proof. Mathematical induction, diagonalization principle. Basic counting. Set operations, relations, functions. Grammars and finite state automata. Boolean algebra. Truth tables and minimization of Boolean expressions. Applications to computer science and engineering.
Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: 4 Lecture/Recitation/Discussion Hours: 4
Prerequisite:
MTH 133 or MTH 126 or MTH 153H or LBS 119
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.
Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: 4 Lecture/Recitation/Discussion Hours: 4
Prerequisite:
MTH 133 or MTH 126 or MTH 153H or LB 119
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.
Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: 4 Lecture/Recitation/Discussion Hours: 4
Prerequisite:
MTH 133 or MTH 126 or MTH 153H or LB 119
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.
Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: 4 Lecture/Recitation/Discussion Hours: 5
Prerequisite:
MTH 133 or MTH 126 or MTH 153H or LB 119
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.
Semester:
Fall of every year, Spring of every year, Summer of every year
Credits:
Total Credits: 4 Lecture/Recitation/Discussion Hours: 5
Prerequisite:
MTH 133 or MTH 126 or MTH 153H or LB 119
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.