CAS MA 531
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.
FALL 2015 Schedule
|A1||MCS B23||TR 11:00 am-12:30 pm||Mts w/GRS PH661
Mts w/CAS PH461