1st degree (Bachelor)
Prof. Omer Ben Neria
Coordinator Office Hours:
set an appointment
Prof Omer Ben-Neria
In the beginning of the 20th century mathematicians tried to find a complete system of axioms for the whole of mathematics and in particular for number theory.
Godel showed that these efforts cannot succeed: Godel's incompleteness theorem says that in any reasonable system of axioms there is always a true statement which cannot be proved.
In the course we will review the incompleteness theorems and relevant parts of recursion theory. We will also learn about Peano Arithmetic.
In addition the course includes an introduction to model theory.
See learning outcomes.
Learning outcomes - On successful completion of this module, students should be able to:
Better understanding of mathematical logic, the tools it provides (like compactness) and its limitations (the incompleteness theorem).
Teaching arrangement and method of instruction:
This is a list of some of the subjects that will be covered in the course:
Godel's incompleteness theorems on Peano arithmetic.
Tarski's truth theorem.
Recursion theory: recursive function, the recursion theorem, RE sets.
Model theory: ultraproducts, compactness, Lowenheim-Skolem theorems.
Models of Peano Arithmetic.
Additional Reading Material:
R. Smullyan, Godel's Incompleteness Theorems
R. Kaye, Models of Peano Arithmetic
J.L. Bell and M. Machover, A Course in Mathematical Logic
J.R. Shoenfield, Mathematical Logic
H. Enderton, A Mathematical Introduction to Logic
End of year written/oral examination 0 %
Presentation 0 %
Participation in Tutorials 0 %
Project work 50 %
Assignments 50 %
Reports 0 %
Research project 0 %
Quizzes 0 %
Other 0 %
The grade will be based on students presenting solutions to exercises during the semester and a final assignment