Module 02316 (2003)
Syllabus page 2003/2004
06-02316
Logic
Level 1/C
Volker Sorge
10 credits in Semester 2
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus
The Module Description is a strict subset of this Syllabus Page. (The University module description has not yet been checked against the School's.)
Relevant Links
For more information (like notes, handouts) see the module web page at
http://www.cs.bham.ac.uk/~mmk/Teaching/MathLogic/.
Outline
Aims
The aims of this module are to:
- introduce the main concepts of classical logic, and to appreciate some of its uses in computer science
- introduce the basics of reasoning about programs
Learning Outcomes
| On successful completion of this module, the student should be able to: | Assessed by: | |
| 1 | ||
| 2 | understand the syntax, semantics, and proof theory of propositional logic, and perform natural deduction proofs | Examination |
| 3 | understand the syntax, semantics, and proof theory of predicate logic, and perform easy natural deduction proofs | Examination |
| 4 | understand basic notions of the Hoare calculus | Examination |
Restrictions, Prerequisites and Corequisites
Restrictions:
None
Prerequisites:
None
Co-requisites:
None
Teaching
Teaching Methods:
2 lectures and 1 exercise class per week.
Contact Hours:
Assessment
- Supplementary (where allowed): As the sessional assessment
- 1.5 hr examination (80%), continuous assessment (20%). Resit by examination only.
Recommended Books
| Title | Author(s) | Publisher, Date |
| Logic in Computer Science: Modelling and reasoning about systems | Michael R A Huth and Mark D Ryan | Cambridge Univ. Press, 2000 |
| Discrete Mathematics by Example | Andrew Simpson | McGraw Hill, 2002 |
| Discrete Mathematics and its applications | Kenneth H. Rosen | McGraw Hill, 2003 |
| Mathematics as a Second Language (4th ed) | Joseph Newmark and Frances Lake | Addison-Wesley, 1987 |
Detailed Syllabus
- General motivation, syntax, semantics for atomic formulae, consequence relation, notion of soundness and completeness (2 lectures)
- Propositional logic (8 lectures)
- Connectives
- Syntax, semantics
- Examples
- Natural deduction calculus
- First-order logic (4 lectures)
- Syntax, semantics
- Natural deduction calculus
- Equality (2 lectures)
- Reasoning about programs (6 lectures)
- Specification and partial correctness of programs
- Hoare calculus
- Examples
Last updated: 2 July 2003
Source file: /internal/modules/COMSCI/2003/xml/02316.xml
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus