Undergraduate Prerequisites: CASPH 360. - A working through of Godel’s famous 1931 paper on the incompleteness of arithmetic, alongside the proof of Turing’s 1936 proof of the undecidability of logic and Tarski’s analysis of the concept of truth for formalized languages. Warren Goldfarb’s “Notes on Metamathematics” are used alongside the original material. Students learn to carry out techniques of arithmetization of syntax and understand the workings in the context of Godel’s proof, including the formalization of proof, consistency, and other metamathematical notions, and the concept of primitive recursivity.

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