Description: Computational Logic

A rigorous introduction to logic from a computational perspective. The course covers propositional logic and relational logic. Topics 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.

Prerequisites:

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 CS103).

Lecture Time and Location:

Tuesday and Thursday 02:15 PM - 03:30 PM, Gates B03

Readings:

Lecture notes are available on the WWW at the course URL.

http://logic.stanford.edu/classes/cs157/2008/cs157.html

Enderton, H.: A Mathematical Introduction to Logic, 1972.

CS157 is offered for 3-4 units. The requirements (same for both number of units) 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.

Make sure to sign up through Axess.

Final Exam:

The Registrar has listed our final exam to be held Monday, December 8 from 3:30pm to 6:30pm.