CAS PH 461
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 MA 531.
FALL 2013 Schedule
|A1||Kanamori||MCS B23||TR 11:00 am-12:30 pm||Mts w/CAS MA531
& GRS PH661