Module 08764 (2001)
Syllabus page 2001/2002
06-08764
Mathematics & Logic B
Level 1/C
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
Propositional logic, predicate logic (syntax, semantics and natural deduction), probabilities.
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 probability theory and statistics and some applications in computer science
Learning Outcomes
| On successful completion of this module, the student should be able to: | Assessed by: | |
| 1 | understand the syntax, semantics, and proof theory of propositional logic, and perform natural deduction proofs | Examination |
| 2 | understand the syntax, semantics, and proof theory of predicate logic, and perform easy natural deduction proofs | Examination |
| 3 | understand notions of probability theory and apply them to simple examples | Examination |
| 4 | understand and apply the basic concepts of statistics | Examination |
Restrictions, Prerequisites and Corequisites
Restrictions:
None
Prerequisites:
None
Co-requisites:
06-08762 (Mathematics & Logic A) (linked module)
Teaching
Teaching Methods:
2 lectures and 1 exercise class per week.
Contact Hours:
Assessment
- Supplementary (where allowed): As the sessional assessment
- 3 hr examination (90%), continuous assessment (10%), divided equally between this module and 06-08762 (Mathematics & Logic A). 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 |
| Mathematics as a Second Language (4th ed) | Joseph Newmark and Frances Lake | Addison-Wesley, 1987 |
Detailed Syllabus
-
semantics for atomic formulae, consequence relation, notion
of soundness and completeness (4 lectures)
- informal introduction, relationship to data bases, Boolean expressions in programming languages, formal semantics.
- Conjunction (2 lectures)
- Syntax, semantics, rules, calculus examples.
- Implication, disjunction, natural deduction proofs (2 lectures)
- Syntax, semantics, rules
- Negation, propositional logic in overview (2 lectures)
- Syntax, semantics, natural deduction calculus
- Variables, quantification (2 lectures)
- Syntax, semantics, natural deduction calculus
- Probabilities (4 lectures)
- Permutations, Combinations, Elementary probabilities, Conditional probabilities, dependence, independence
- Statistics (6 lectures)
- Median, mean, variance, distributions, correlation, experimental methods
Last updated: 29 July 2001
Source file: /internal/modules/COMSCI/2001/xml/08764.xml
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus