Postgraduate Course: Mathematical Logic (MSc) (PHIL11044)
Course Outline
| School | School of Philosophy, Psychology and Language Sciences |
College | College of Humanities and Social Science |
| Course type | Standard |
Availability | Available to all students |
| Credit level (Normal year taken) | SCQF Level 11 (Postgraduate) |
Credits | 20 |
| Home subject area | Philosophy |
Other subject area | None |
| Course website |
None |
Taught in Gaelic? | No |
| Course description | A one-semester course in mathematical logic covering the following topics. Basic arithmetic and set theory (including cardinality, diagonalization, inductive definitions). Review of introductory logic. The Completeness theorem for first-order logic and related metalogical results. Theory of computability (Turing machines and recursive functions). Axiomatic systems of arithmetic. Limitative results: undecidability and incompleteness). Supplementary topics may include extended logics (modal and second-order) and non-classical logics (intuitionistic and many-valued) logics.
Shared with UG Course PHIL10053 Mathematical Logic.
|
Entry Requirements (not applicable to Visiting Students)
| Pre-requisites |
Students MUST have passed:
Logic 1 (PHIL08004)
|
Co-requisites | |
| Prohibited Combinations | |
Other requirements | Students holding an undergraduate degree from another institution should have passed an introductory course in logic before taking this course. |
| Additional Costs | None |
Information for Visiting Students
| Pre-requisites | Visiting students should have passed an introductory course in logic. We will only consider University/College level courses. |
| Displayed in Visiting Students Prospectus? | Yes |
Course Delivery Information
| Not being delivered |
Summary of Intended Learning Outcomes
Students who have completed this course should be able to:
* Demonstrate a good understanding of the semantics (and deductive systems) for propositional and first-order logic
* Demonstrate a good understanding of the proofs of the soundness and completeness theorems, and related metalogical results, for propositional and first-order logic
* Demonstrate a good understanding of the formalization of arithmetic, and the limitative / incompleteness results for formal systems of arithmetic |
Assessment Information
| Exam only |
Special Arrangements
| None |
Additional Information
| Academic description |
Not entered |
| Syllabus |
Not entered |
| Transferable skills |
Not entered |
| Reading list |
Not entered |
| Study Abroad |
Not entered |
| Study Pattern |
Not entered |
| Keywords | Not entered |
Contacts
| Course organiser | Dr Tillman Vierkant
Tel: (0131 6)51 3748
Email: T.Vierkant@ed.ac.uk |
Course secretary | Miss Lynsey Buchanan
Tel: (0131 6)51 5002
Email: Lynsey.Buchanan@ed.ac.uk |
|
|
University Homepage