MATH20302 - 2011/2012
- Title: Propositional Logic
- Unit code: MATH20302
- Credit rating: 10
- Level: 2
- Pre-requisite units: MATH10101 or MATH10111 (students who have not taken one of these course units should discuss this with the lecturer)
- Co-requisite units:
- School responsible: Mathematics
- Members of staff responsible:
The programme unit aims to introduce the student to the idea of formalising arguments, both semantically and syntactically, and to the fundamental connection between these approaches.
Logic is the study of arguments: what they are and what it means to say that they are sound. As such it is central to Mathematics, Philosophy and, to an increasing extent in recent years, Computer Science.
Most of this course unit will deal with the most basic sort of logical argument (i.e., in everyday parlance, what we mean by 'A follows from B'), namely those which depend for their soundness simply on the commonly agreed interpretations of the logical connectives 'not', 'and', 'or' and 'implies'. That is referred to as propositional logic.
We shall characterise the above notion of 'follows' in two fundamentally different ways, firstly in terms of preservation of truth (semantically), and secondly in terms of the formal rules it obeys (proof theoretically, or syntactically). The highlight of the course unit will be the Completeness Theorem for Propositional Logic, which tells us that these two quite different characterisations are equivalent. This is the younger sibling of the Completeness Theorem for Predicate Logic (which is covered in the course, MATH33001, on Predicate Logic). That is a fundamental result for Mathematics which says that one can set up a notion of formal mathematical proof which is strong enough to capture mathematical truth: if something isn't formally provable then there must exist a counterexample. The propositional logic version of that theorem already allows us to introduce the key concepts and to see how a proof of such a general result can be achieved.
In the final few lectures the student is introduced to some basic ideas about predicate logic. This deals with languages which allow the use of variables together with the quantifiers "for all..." and "there exists..." as well as functions, relations and constants. Such languages are of far greater expressive power than those of propositional logic and using them one can, in principle, formalise any mathematical argument. This part of the course unit serves as a brief introduction to these logics with quantifiers and to concepts which will be used in some level 3/4 units in Logic.
Intended learning outcomes
On completion of this unit successful students will be able to:
formalise arguments in propositional logic both semantically and syntactically and understand how these are connected (via the Completeness Theorem);
in simple cases be able to determine whether 'A follows from B' is true, using a variety of methods;
- be able to interpret formulas and sentences of predicate logic in mathematical structures
Future topics requiring this course unit
The course unit forms a coherent subject on its own, and provides necessary background knowledge for the third and fourth level Logic course units.
- Motivation, syntax, propositional variables, connectives, sentences. [2 lectures]
- Valuations, logical consequence, logical equivalence, truth tables, satisfiability, Beth Trees. The Disjunctive Normal Form Theorem, expressibility, adequate sets of connectives. 
- Rules of proof, formal proofs, the Correctness Theorem. 
- Consistency, the Completeness and Compactness Theorems. 
- The language of the Predicate Calculus. Structures and interpretations, with examples. Satisfaction, logical validity, and logical consequence for the predicate calculus. 
Course unit notes will be provided. It will not be necessary to buy any books, but there a number of good books around which the student might enjoy (although they all tend to use substantially different notation, so that they are definitely not alternatives to the course unit notes), for example:
- H.B. Enderton, A Mathematical Introduction to Logic, (second edition) Academic Press 2001, ISBN 0122384520.
- E. Mendelson, Introduction to Mathematical Logic, Wadsworth and Brooks 1997, ISBN 0534066240.
- E.J. Lemmon, Beginning Logic, Van Nostrand Reinhold (UK) 1971, ISBN 0442306768.
Learning and teaching processes
Two lectures and one examples class each week. In addition students should expect to do at least four hours private study each week for this course unit.
- Two take home tests; Weighting within unit 20%
- 2 hours end of semester examination; Weighting within unit 80%