A rigorous introduction to logic from a computational perspective. The course covers both propositional logic and relational logic. Topics in logic include syntax, semantics, models, logical entailment, proofs, soundness, completeness, and decidability. Reasoning methods include the truth table method, natural deduction, the Davis-Putnam procedure, resolution, model elimination, demodulation, and paramodulation.
Ease with mathematical definitions and arguments (as obtained, for example, in Math120) and familiarity with the basic concepts of computation (as obtained, for example, in CS103B).
Tuesday and Thursday 11:00-12:15, Gates B03
Lecture notes are available on the WWW at the course URL.
CS157 will primarily be offered for 3 units. The requirements for this include four problem sets and a very easy final exam. Each will be worth 20% of the total grade. All problem sets will be submitted electronically.
The class may also be taken for 4 units. If you would like to take the class for 4 units, please contact the course staff and we will arrange appropriate work for the extra unit.
Make sure to sign up through Axess.