|Unit level:||Level 6|
|Teaching period(s):||Semester 2|
|Offered by||School of Mathematics|
|Available as a free choice unit?:||N
Students are not permitted to take, for credit, MATH43042 in an undergraduate programme and then MATH63042 in a postgraduate programme at the University of Manchester, as the courses are identical.
The main goal is to present a rigorous understanding of Godel's Incompleteness theorems and their most important consequences.
Can a computer be programmed to generate all true statements of mathematics and no false ones? An extraordinary result, proved by Kurt Godel in 1931, shows that even if we restrict ourselves to the most fundamental part of mathematics, namely statements about the natural numbers, the answer to the above question is no. Moreover Godel's method is such that given any "mechanical procedure" for generating true statements about the natural numbers we are actually able to construct a true statement about the natural numbers which will not be generated by that procedure. Later results have shown that such statements can always be chosen to have the simple logical form of an assertion that a particular polynomial equation has no solution over the integers.
Godel's work stands as one of the great landmarks of 20th century thought and has a significance which reaches well beyond mathematics. The course unit will be centred on proofs of Godel's two incompleteness theorems and will examine some of their principal applications.
On successful completion of this course unit students will
- be familar with a proof system for predicate logic and the completeness theorem;
- be familar with recursive functions and their representation in logic;
- be able to formulate and understand Godel's incompleteness theorems and their applications to logic and decision problems.
- Other - 20%
- Written exam - 80%
Assessment Further Information
- Two take home tests weighting 10% each
- End of semester examination: two and a half hours weighting 80%
(The numbers in square brackets indicate the hours spent on the respective topic by lecturers and feedback time.)
1. A proof system for predicate logic.First order theories, structures and the completeness theorem. 
2. Recursive functions and relations, a revision. Basic properties. Primitive recursion. Closure under bounded quantification. Gödel's β-function. Coding of finite sequences. Recursively enumerable sets. Church-Turing Thesis. 
3. Rrepresentation of recursive functions in arithmetic; Robinson Arithmetic. 
4. Gödel numbering and the arithmetization of logic. The recursiveness of the proof predicate. Gödel first incompleteness theorem. Tarskis undefinability theorem. 
5. Applications of the incompleteness theorem. Undecidability of the predicate calculus and other axiom systems. Peano Arithmetic. 
6. Kleenes Enumeration Theorem. Hilberts 10th problem. The MRDP theorem and its corollaries. 
7. Gödel's second incompleteness theorem. The limitations of the axiomatic method. 
Self contained course notes will be provided, although the first two books listed below cover much of it, albeit using different notation.
- H.B. Enderton, A Mathematical Introduction to Logic, (especially chapter 3), Academic Press,
- J.R. Shoenfield, Mathematical Logic, (chapters 4 and 6). Addison-Wesley 1967,
- Peter Smith, An Introduction to Godels Theorems, Cambridge University Press, 2007,
- Hao Wang, A Logical Journey, MIT Press, 1997,
- Hao Wang, From Mathematics to Philosophy. RKP 1974,
- G.T. Kneebone, Mathematical Logic and the Foundations of Mathematics. Van Nostrand 1963.
A third of the 33 hours will be used for an opportunity for students' to discuss the work and to provide feedback on their understanding. Two take home tests provide an opportunity for students to receive feedback. Students can also get feedback on their understanding during the lecturer's office hour.
- Lectures - 22 hours
- Tutorials - 11 hours
- Independent study hours - 117 hours