.. include:: ../shared/organizationHeader.rst
.. include:: ../shared/courseOutline.rst


* Set Theory
* Direct Proofs
* Indirect Proofs
* Propositional Logic
* First-order Logic
* Binary Relations
* Functions
* Number Theory
* Counting
* Graphs
* Induction
* Finite Automata
* Formal Languages

.. include:: ../shared/groundRules.rst



Textbook
++++++++
Times are hard and textbooks are expensive. Good news is that I have uploaded most of your reading material and all handouts on our GitHub page.



Grading scheme
++++++++++++++

Course performance is determined using in-class assignments, weekly homework, a take-home midterm, and a take-home final. Each assessment component carries a 25% weight. Grading scheme aside, the objective of assessments in this course is to ensure **that students are learning.** In this context students make mistakes, understand them, and do not repeat them.

.. include:: ../shared/deadlines.rst
.. include:: ../shared/inClassAssignments.rst


Exam dates
++++++++++
The final exam will be a take-home assignment. It will become available at TBD on TBD and due at TBD PM on TBD (subject to change).

The midterm exam will be a take-home assignment. It will become available on Sakai at TBD on TBD and due at TBD on TBD (subject to change).


.. include:: ../shared/studentHours.rst
.. include:: ../shared/academicIntegrity.rst
.. include:: ../shared/professionalism.rst
.. include:: ../shared/zoom.rst
.. include:: ../shared/formalStuff.rst

.. include:: ../shared/DEI_statement.rst