Module manager: Alastair Wilson
Email: A.J.J.Wilson@leeds.ac.uk
Taught: Semester 1 (Sep to Jan) View Timetable
Year running 2023/24
PHIL 1250
| PHIL1250 | How to Think Clearly and Argue Well |
| MATH2040 | Mathematical Logic 1 |
| MATH2042 | Logic with Computation |
PHIL2010 Formal Logic
This module is not approved as a discovery module
This module is only available as a discovery module for students studying on Linguistics, Mathematics and Computing modules with relevant prerequisites.Throughout the history of philosophy, philosophers have been keen to identify the principles of logic: those most general principles that we can always rely on not to take us wrong. You will learn about rigorous methods for proving whether an argument is valid or invalid. You will learn how to reason formally about a formal system. You will learn about modern developments in non-classical logic. This module will be of use and interest to mathematicians and computer scientists. But it should also be of use and interest to anyone who is interested in how we can rigorously establish conclusions: the formal study of logic is not some abstract technical theory, but a tool for sharpening our own thinking. There is no area of study in which argument is not important, and therefore no area of study in which knowledge of logic cannot help.The module is taught through lectures and tutorials and assessed by a final exam.
On completion of this module, students should be able to:
1. Formalize natural language arguments in first-order quantified logic.
2. Use a proof system (axiomatic, natural deduction, or truth trees) to complete derivations with formulas involving both connectives and quantifiers.
3. Demonstrate an understanding of model-theoretic notions like validity and invalidity, and be able to recognize a countermodel for invalid formulas and arguments.
4. Demonstrate an understanding of basic metatheoretical claims about first-order proof systems, like e.g. soundness and completeness.
1. Revision: translation into a formal system and truth tables.
2. Introduction of a proof system for propositional first-order logic.
3. Introduction of a proof system for quantified first-order logic.
4. Basic metatheory: statement of soundness and completeness theorems for first-order logic.
| Delivery type | Number | Length hours | Student hours |
|---|---|---|---|
| Lecture | 18 | 1 | 18 |
| Tutorial | 9 | 1 | 9 |
| Private study hours | 173 | ||
| Total Contact hours | 27 | ||
| Total hours (100hr per 10 credits) | 200 | ||
- Lecture preparation: 74 hours
- Tutorial preparation: 49 hours
- Assessment preparation: 50 hours.
Tutorials and office hours
| Exam type | Exam duration | % of formal assessment |
|---|---|---|
| Online Time-Limited assessment | 3.0 Hrs 0 Mins | 100 |
| Total percentage (Assessment Exams) | 100 | |
Normally resits will be assessed by the same methodology as the first attempt, unless otherwise stated
The reading list is available from the Library website
Last updated: 8/21/2023
Errors, omissions, failed links etc should be notified to the Catalogue Team