Save To Worklist
PHIL 320 Logic: Metatheory and Computability
Continuation of PHIL 220. A system of deduction for predicate logic is selected for further study. Completeness of this system and other metatheoretic results are proved. Other topics include computability, recursive function theory, incompleteness and decidability.
Pre-reqs: PHIL 220.
|Status||Section||Activity||Term||Interval||Days||Start Time||End Time||Comments|
|PHIL 320 001||Web-Oriented Course||2||Mon Wed Fri||10:00||11:00|