NMAA13036U Introduction to Mathematical Logic
MSc Programme in Mathematics
First order logic, languages, models and examples. Formal deduction, deduction metatheorems, soundness, completeness and compactness, and applications of compactness. Recursion theory, computable functions on the natural numbers, Turing machines, recursively enumerable sets, and arithmetization of first order syntax. Basic axiomatic set theory, ordinals and cardinals.
Knowledge: By the end of the course, the student is expected to be able to explain the concepts of: a first order language; of a model of a first order language; of formal deduction; of a computable relation and function; arithmetization of first order syntax; the axioms of Zermelo-Fraenkel set theory; ordinals and cardinals.
Skills: By the end of the course, the student must be able to define the satisfacation relation, account for the axioms of the deductive system, define the notion of recursive function, and prove that a repository of common functions and relations are recursive, including the coding of basic syntactical notions. The student must be able to prove the key theorems of the course, such as the deduction theorem, the soundness theorem, and the compactness theorem.
Competences: Use of first order languages and structures in mathematics, the formalization of proofs, the coding of syntactical notions in arithmetic. Use ordinal analysis and transfinite recursion.
- 7,5 ECTS
- Type of assessment
- Oral examination, 30 minWith 30 minutes preparation time
- Exam registration requirements
To be eligible to take the final exam the student must have handed in the 2 mandatory homework assignments, and these must both have been approved.
- Only certain aids allowed
Notes and the text book.
- Marking scale
- 7-point grading scale
- Censorship form
- No external censorship
Several internal examiners
Same as ordinary exam. If the the 2 mandatory homework assignments were not approved before the ordinary exam they must be handed in at the latest two weeks before the beginning of the re-exam week. They must be approved before the re-exam.
Criteria for exam assesment
The student must in a satisfactory way demonstrate that he/she has mastered the learning outcome of the course.
- Theory exercises
- Project work