MATH43032 - 2007/2008
- Title: Non-Standard Logics
- Unit code: MATH43032
- Credits: 15
- Prerequisites: A good working knowledge of the propositional calculus such as that given by MT2151/MATH20302 Propositional Logic, MATH31011 (2006-2007) Mathematical Logic.
- Co-requisite units: None
- School responsible: Mathematics
- Member of staff responsible: Dr. Marcus Tressl
Specification
Aims
The aim of this course is to expose the students to the formal mathematical and philosophical aspects of a range of non-standard logics which are currently of importance in IT.
Brief Description of the unit
Non-standard logics are logics which capture other features of arguments, or reasoning, beyond those expressible in the basic, classical, propositional and predicate calculi. As such they have always been of direct interest and relevance to Philosophers and Logicians. However, this subject has taken off in the last 25 years or so because of the need in Computer Science (and especially in the sub-area of Information Technology) to formalise a range of patterns of r easoning for use in so called 'intelligent computers'.
In this course we shall look at three such families of (propositional) logics, nonmonotonic, modal and many valued (or 'fuzzy'). Our approach will, however, remain very much within the tradition of mathematical logic and philosophy, concentrating on understanding the key ideas and theorems (in particular deriving completeness theorems), rather than studying practical IT applications.
Learning Outcomes
On successful completion of this course unit students will be able to
- appreciate how non-standard logics can be developed and used to formalise various patterns of reasoning;
- be able to construct simple (formal) proofs within the non-standard logics studied;
- understand the proofs of the relevant completeness theorems and be able to apply these theorems to give semantic arguments for, or against, formal derivability.
Future topics requiring this course unit
None.
Syllabus
- Nonmonotonic Logic: The GM rules, rational consequence relations. The LMK Representation Theorem and the rational closure of a conditional knowledge base. Theory revision. [9 lectures]
- Modal Logic: Necessity and possibility. The systems K,T,D,B,S4,S5. Examples of proofs. Normal forms. Frames and semantics. The Completeness Theorems for K and S4. [8]
- Intuitionistic Logic: Kripke Structures and relationship to S4 frames. The proof theory for Propositional Intuitionistic Logic and the Completeness Theorem. [5]
- Real Valued Logic: Fuzzy Logic, degrees of truth, truth functionality, Łukasiewicz, Gödel and Product Logics and the Mostert-Shields theorem (statement only). McNaughton's Theorem. The proof theorem for Łukasiewicz Logic, examples of proofs and the statement of its Completeness Theorem.. [8]
Textbooks
The course is self contained and you will not be required to consult any books. However the following cover some of the same material as the course and may provide interesting complementary reading.
- G.E. Hughes and M.J. Cresswell, A Companion to Modal Logic, Methuen,
- G.E. Hughes and M.J. Cresswell, An Introduction to Modal Logic, Methuen,
- B.F. Chellas, Modal Logic: An Introduction, Cambridge University Press.
- P. Hájek, Metamathematics of Fuzzy Logic, Kluwer, 1998.
- J.B. Paris, The Uncertain Reasoner's Companion, Cambridge University Press, 1994.
- E. Schecht, Classical and Non-Classical Logics, Princeton University Press, 2007.
- Mid-semester coursework: two take home tests weighting 20%
- End of semester examination: two and a half hours weighting 80%
Teaching and learning methods
30 lectures plus weekly office hours.
Assessment
Arrangements
Timing of the course
Lectures for this course unit are shared with lectures for an MSc course unit and are at this level with quite a lot of materal left for students to fill in for themselves. The classes will take place in the eight weeks prior to the Easeter vacation. The examination will take place soon after the Easter vacation and before the normal examination period.
