The syntax and semantics of sentential and quantificational logic, culminating in the Gödel Completeness Theorem. The Gödel Incompleteness Theorem and its ramifications for computability and philosophy. Also offered as CAS PH 461.

Note that this information may change at any time. Please visit the Student Link for the most up-to-date course information.