F17LP - Logic and Proof

Course leader(s):

Mark Lawson (Edinburgh, September)
Hind Zantout (Dubai, September)
To be announced (Dubai, September)
To be announced (Edinburgh, May)
To be announced (Dubai, May)
To be announced (Malaysia, May)

Aims

To give an introduction to and an appreciation of the basic principles and techniques of logic and proof fundamental to Computer Science.

Syllabus

1. 1 and 2 (1.1 What the propositional connectives means via truth tables., 1.2 Truth tables of compound formulae., 1.3 The meaning of the terms satisfiable, contradiction, tautology.)

2.1 Equivalence of formulae., 2.2 Adequate sets of connectives., 2.3 Functional completeness and disjunctive normal form.

3.1 Valid arguments., 3.2 Truth trees and how to use them.

4. 6 and 7 (4.1 Boolean algebras and how to use them in circuit design.)

5. 8 and 9 (5.1 First order logic with function symbols., 5.2 Truth trees for first order logic.)

Learning outcomes

By the end of the course, students should be able to do the following:

1. Construct truth tables of compound propositions.
Determine whether a proposition is satisfiable, a tautollogy or a contradiction.
Convert between different forms.
Convert an argument into symbolic form and determine if it is valid.
Solve problems in symbolic logic using truth trees
Solve simple problems using Boolean algebras
Design simple circuits
Be able to interpret first-order formulae
Solve problems in first-order logic using truth trees

Further details

Curriculum explorer: Click here

SCQF Level: 7

Credits: 15